|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Premkumar Vadapalli, Pradip K. Srimani, "A New Family of Cayley Graph Interconnection Networks of Constant Degree Four," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 1, pp. 26-32, January, 1996. | |||
| BibTex | x | ||
| @article{ 10.1109/71.481595, author = {Premkumar Vadapalli and Pradip K. Srimani}, title = {A New Family of Cayley Graph Interconnection Networks of Constant Degree Four}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {7}, number = {1}, issn = {1045-9219}, year = {1996}, pages = {26-32}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.481595}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Parallel and Distributed Systems TI - A New Family of Cayley Graph Interconnection Networks of Constant Degree Four IS - 1 SN - 1045-9219 SP26 EP32 EPD - 26-32 A1 - Premkumar Vadapalli, A1 - Pradip K. Srimani, PY - 1996 KW - Interconnection network KW - Cayley graph KW - constant degree KW - fault tolerance KW - generators KW - simple routing KW - optimal routing. VL - 7 JA - IEEE Transactions on Parallel and Distributed Systems ER - | |||
Abstract—We propose a new family of interconnection networks that are Cayley graphs with constant node degree 4. These graphs are regular, have logarithmic diameter, and are maximally fault tolerant. We investigate different algebraic properties of these networks (including fault tolerance) and propose optimal routing algorithms. As far as we know, this is the first family of Cayley graphs of constant degree 4.
[1] S.B. Akers and B. Krishnamurthy,"The star graph: An attractive alternative to n-cube," Proc. Int'l Conf. Parallel Processing (ICPP 87), pp. 393-400,St. Charles, Ill., Aug. 1987.
[2] S.B. Akers and B. Krishnamurthy, “A Group-Theoretic Model for Symmetric Interconnection Networks,” IEEE Trans. Computers, vol. 38, no. 4, pp. 555-566, Apr. 1989.
[3] B.W. Arden and K.W. Tang,“Representation and routing of Cayley graphs,” IEEE Trans. Comm., vol. 39, no. 11, pp. 1,533-1,537, Nov. 1991.
[4] L. Bhuyan and D.P. Agrawal,"Generalized hypercube and hyperbus structure for a computer network," IEEE Trans. Computers, vol. 33, no. 3, pp. 323-333, Mar. 1984.
[5] C. Chen, D.P. Agrawal, and J.R. Burke, "dBCube: A New Class of Hierarchical Multiprocessor Networks with Area Efficient Layout," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 12, pp. 1,332-1,344, Dec. 1993.
[6] G.E. Carlsson,J.E. Cruthirds,, and H.B. Sexton,“Interconnection networks based on a generalization of cube-connectedcycles,” IEEE Trans. Computers, vol. 334, no. 8, pp. 769-772, Aug. 1985.
[7] K. Day and A. Tripathi,"Arrangement graphs: A class of generalized star graphs," Information Processing Letters, vol. 42, pp. 235-241, July 1992.
[8] S. Even and R.E. Tarjan,"Network flow and testing graph connectivity," SIAM J. Computing, vol. 4, pp. 507-518, 1975.
[9] S. Even,Graph Algorithms. Pitman Publishing, 1979.
[10] S. Guha and A. Sen,"On fault tolerant distributor communication architecture," IEEE Trans. Computers, vol. 35, no. 3, pp. 281-283, Mar. 1986.
[11] F. Harary,Graph Theory.Reading, Mass.: Addison-Wesley, 1972.
[12] S. Lakshmivarahan,J.S. Jwo, and S.K. Dhall,"Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey," Parallel Computing, vol. 19, pp. 361-407, 1993.
[13] W.E. Leland and M.H. Solomon,"Dense trivalent graphs for processor interconnection," IEEE Trans. Computers, vol. 31, no. 3, pp. 219-222, Mar. 1982.
[14] D.K. Pradhan and S.M. Reddy,"A fault tolerant communication architecture for distributed systems," IEEE Trans. Computers, vol. 31, no. 9, pp. 863-870, Sept. 1982.
[15] D.K. Pradhan,"Fault tolerant VLSI architectures based on de Bruijn graphs (Galileo in the mid nineties)," DIMACS Series in Discrete Math., vol. 5, 1991.
[16] F.P. Preparata and J. Vuillemin, “The Cube-Connected Cycles: A Versatile Network for Parallel Computation,” Comm ACM, vol. 24, no. 5, pp. 300-309, 1981.
[17] K. Qiu, S.G. Akl, and H. Meijer, "On Some Properties and Algorithms for the Star and Pancake Interconnection Networks," J. Parallel and Distributed Computing, vol. 22, pp. 16-25, 1994.
[18] K. Qiu,H. Meijer, and S.G. Akl,"Decomposing a star graph into disjoint cycles," Information Processing Letters, vol. 39, no. 3, pp. 125-129, 1991.
[19] I.D. Scherson,"Orthogonal graphs for the construction of interconnection networks," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 1, pp. 3-19, 1991.
[20] M.R. Samatham and D.K. Pradhan, "The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI," IEEE Trans. Computers, vol. 38, no. 4, pp. 567-581, Apr. 1989.
[21] Y. Saad and M. Schultz, "Topological Properties of Hypercubes," IEEE Trans. Computers, vol. 37, no. 7, pp. 867-872, July 1988.