Macro-star networks: Efficient low-degree alternatives to star graphs

IEEE Transactions on Parallel and Distributed Systems

Volumn 9, Issue 10, 1998, Pages 987-1003

  Yeh, Chi Hsiang ^a,b   Varvarigos, Emmanouel A ^a,b  

^a IEEE   (United States)

^b University of California   (United States)

Author keywords

Algorithm emulation; Cayley graphs; Interconnection networks; Multinode broadcast; Parallel architectures; Routing; Star graphs; Total exchange

Indexed keywords

COMPUTER ARCHITECTURE; DATA COMMUNICATION SYSTEMS; INTERCONNECTION NETWORKS; PARALLEL ALGORITHMS;

CAYLEY GRAPHS; MULTINODE BROADCAST; PARALLEL ARCHITECTURE; ROUTING; STAR GRAPHS;

PARALLEL PROCESSING SYSTEMS;

EID: 0032181461     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.730528     Document Type: Article

References (53)

1. S. Abraham and K. Padmanabhan, "Performance of Multicomputer Networks Under Pin-Out Constraints," J. Parallel and Distributed Computing, vol. 12, no. 3, pp. 237-248, July 1991.
2. A. Agarwal, "Limits on Interconnection Network Performance," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 4, pp. 398-412, Oct. 1991.
3. S.B. Akers, D. Harel, and B. Krishnamurthy, "The Star Graph: An Attractive Alternative to the n-Cube," Proc. Int'l Conf. Parallel Processing, pp. 393-400, 1987.
4. S.B. Akers and B. Krishnamurthy, "The Fault Tolerance of Star Graphs," Proc. Int'l Conf. Supercomputing, vol. III, pp. 270-276, 1987.
5. S.B. Akers and B. Krishnamurthy, "A Group-Theoretic Model for Symmetric Interconnection Networks," IEEE Trans. Computers, vol. 38, no. 4, pp. 555-565, Apr. 1989.
6. S.G. Akl, K. Qiu, and I. Stojmenovic, "Fundamental Algorithms for the Star and Pancake Interconnection Networks with Applications to Computational Geometry," Networks, vol. 23, pp. 215-225, July 1993.
7. S.G. Akl and K.A. Lyons, Parallel Computational Geometry. Englewood Cliffs, N.J.: Prentice Hall, 1993.
8. M.M. de Azevedo, "Star-Based Interconnection Networks and Fault-Tolerant Clock Synchronization for Large Multicomputers," PhD dissertation, Dept. of Electrical and Computer Eng., Univ. of California, Irvine, 1997.
9. N. Bagherzadeh, M. Dowd, and S. Latifi, "Faster Column Operations in Star Graphs," Technical Report ECE-94-02-01, Dept. of Electrical and Computer Eng., Univ. of California, Irvine, 1994.
10. N. Bagherzadeh, M. Dowd, and S. Latifi, "A Well-Behaved Enumeration of Star Graphs," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 5, pp. 531-535, May 1995.
11. D. Basak and D.K. Panda, "Designing Clustered Multiprocessor Systems Under Packaging and Technological Advancements," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 9, pp. 962-978, Sept. 1996.
12. D.P Bertsekas and J. Tsitsiklis, Parallel and Distributed Computation - Numerical Methods. Englewood Cliffs, N.J.: Prentice Hall, 1989.
13. L.N. Bhuyan and D.P Agrawal, "Generalized Hypercube and Hyperbus Structures for a Computer Network," IEEE Trans. Computers, vol. 33, no. 4, pp. 323-333, Apr. 1984.
14. A. Bouabdallah, M.C. Heydemann, J. Opatrny, and D. Sotteau, "Embedding Complete Binary Trees into Star Networks," Proc. Int'l Symp. Mathematical Foundations of Computer Science, pp. 266-275, 1994.
15. D. Clark, Proc. Nat'l Science Foundation Workshop Critical Issues in Computer Architecture Research, May 1996.
16. R. Cypher and J.L.C. Sanz, "Hierarchical Shuffle-Exchange and de Bruijn Networks," Proc. IEEE Symp. Parallel and Distributed Processing, pp. 491-496, 1992.
17. W.J. Dally, "Performance Analysis of k-ary n-Cube Interconnection Networks," IEEE Trans. Computers, vol. 39, no. 6, pp. 775-785, June 1990.
18. G. Della Vecchia and C. Sanges, "A Recursively Scalable Network VLSI implementation," Future Generations Computer Systems, pp. 235-243, 1988.
19. D. Duh, G. Chen, and J. Fang, "Algorithms and Properties of a New Two-Level Network with Folded Hypercubes as Basic Modules," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 7, pp. 714-723, July 1995.
20. P. Fragopoulou and S.G. Akl, "Optimal Communication Algorithms on Star Graphs Using Spanning Tree Constructions," J. Parallel and Distributed Computing, vol. 24, pp. 55-71, 1995.
21. K. Ghose and R. Desai, "Hierarchical Cubic Networks," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 4, pp. 427-435, Apr. 1995.
22. R.L. Graham, D.E. Knuth, and O. Patashnik, Concrete Mathematics: A Foundation for Computer Science. Menlo Park, Calif.: Addison-Wesley 1994.
23. M. Hamdi, "A Class of Recursive Interconnection Networks: Architectural Characteristics and Hardware Cost," IEEE Trans. Circuits and Systems - I: Fundamental Theory and Applications, vol. 41, no. 12, pp. 805-816, Dec. 1994.
24. J.-P Huang, S. Lakshmivarahan, and S.K. Dhall, "Analysis of Interconnection Networks Based on Simple Cayley Coset Graphs," Proc. IEEE Symp. Parallel and Distributed Processing, pp. 150-157, 1993.
25. K. Hwang and J. Ghosh, "Hypernet: A Communication-Efficient Architecture for Constructing Massively Parallel Computers," IEEE Trans. Computers, vol. 36, no. 12, pp. 1,450-1,466, Dec. 1987.
26. K. Hwang, Parallel Processing for Supercomputers and Artificial Intelligence. New York: McGraw-Hill, 1989.
27. S.L. Johnsson and C.-T Ho, "Optimum Broadcasting and Personalized Communication in Hypercubes," IEEE Trans. Computers, vol. 38, no. 9, pp. 1,249-1,268, Sept. 1989.
28. J.S. Jwo, S. Lakshmivarahan, and S.K. Dhall, "Embedding of Cycles and Grids in Star Graphs," Proc. IEEE Symp. Parallel and Distributed Processing, pp. 540-547, 1990.
29. D.E. Knuth, The Art of Computer Programming. Reading, Mass.: Addison-Wesley, 1973.
30. P.M. Kogge, "EXECUBE - A New Architecture for Scalable MPPs," Proc. Int'l Conf. Parallel Processing, vol. I, pp. 77-84, 1994.
31. 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, no. 4, pp. 361-407, Apr. 1993.
32. S. Latifi, M.M. de Azevedo, and N. Bagherzadeh, "The Star Connected Cycles: A Fixed-Degree Network for Parallel Processing," Proc. Int'l Conf. Parallel Processing, vol. I, pp. 91-95, 1993.
33. S. Latifi and N. Bagherzadeh, "Incomplete Star: An Incrementally Scalable Network Based on the Star Graph," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 1, pp. 97-102, Jan. 1994.
34. S. Latifi and P.K. Srimani, "Transposition Networks as a Class of Fault-Tolerant Robust Networks," IEEE Trans. Parallel and Distributed Systems, vol. 45, no. 2, pp. 230-238, Feb. 1996.
35. F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. San Mateo, Calif: Morgan Kaufmann, 1992.
36. A. Menn and A.K. Somani, "An Efficient Sorting Algorithm for the Star Graph Interconnection Networks," Proc. Int'l Conf. Parallel Processing, vol. III, pp. 1-8, 1990.
37. Z. Miller, D. Pritikin, and I.H. Sudborough, "Bounded Dilation Maps of Hypercubes into Cayley Graphs on the Symmetric Group," Math. Systems Theory, vol. 29, no. 6, pp. 551-572, Nov./Dec. 1996.
38. J. Misic and Z. Jovanovic, "Communication Aspects of the Star Graph Interconnection Network," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 7, pp. 678-687, July 1994.
39. S. Öhring, F. Sarkar, S.K. Das, and D.H. Hohndel, "Cayley Graph Connected Cycles: A New Class of Fixed-Degree Interconnection Networks," Proc. Int'l Conf. Systems Sciences, pp. 479-487, 1995.
40. B. Parhami, Introduction to Parallel Processing: Algorithms and Architectures. Plenum, 1998.
41. F.P. Preparata and J.E. Vuillemin, "The Cube-Connected Cycles: A Versatile Network for Parallel Computation," Comm. ACM, vol. 24, no. 5, pp. 300-309, May 1981.
42. D.K. Saikia and R.K. Sen, "Order Preserving Communication on a Star Network," Parallel Computing, vol. 21, pp. 771-782, 1995.
43. D.K. Saikia and R.K. Sen, "Two Ranking Schemes for Efficient Computation on the Star Interconnection Networks," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 4, pp. 321-327, Apr. 1996.
44. I.D. Scherson and A.S. Youssef, Interconnection Networks for High-Performance Parallel Computers. Los Alamitos, Calif.: IEEE CS Press, 1994.
45. J.-P Sheu, C.-T. Wu, and T.-S. Chen, "An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 6, pp. 653-658, June 1995.
46. T. Sterling, P. Messina, and P. Smith, Enabling Technologies for Peta(FL)OPS Computing. MIT Press, 1994.
47. T. Sterling and M.J. MacDonald, Proc. PetaFLOPS Frontiers Workshop, 1995.
48. E.A. Varvarigos and D.P Bertsekas, "Communication Algorithms for Isotropic Tasks in Hypercubes and Wraparound Meshes," Parallel Computing, vol. 18, no. 11, pp. 1,233-1,257, Nov. 1992.
49. E.A. Varvarigos and D.P. Bertsekas, "Multinode Broadcast in Hypercubes and Rings with Randomly Distributed Length of Packets," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 2, pp. 144-154, Feb. 1993.
50. C.-H. Yeh and E.A. Varvarigos, "Macro-Star Networks: Efficient Low-Degree Alternatives to Star Graphs for Large-Scale Parallel Architectures," Proc. Symp. Frontiers of Massively Parallel Computation, pp. 290-297, Oct. 1996.
51. C.-H. Yeh and B. Parhami, "Recursive Hierarchical Swapped Networks: Versatile Interconnection Architectures for Highly Parallel Systems," Proc. IEEE Symp. Parallel and Distributed Processing, pp. 453-460, Oct. 1996.
52. C.-H. Yeh and B. Parhami, "Cyclic Networks - A Family of Versatile Fixed-Degree Interconnection Architectures," Proc. Int'l Parallel Processing Symp., pp. 739-743, Apr. 1997.
53. C.-H. Yeh, "Efficient Low-Degree Interconnection Networks for Parallel Processing: Topologies, Algorithms, VLSI Layouts, and Fault Tolerance," PhD dissertation, Dept. of Electrical and Computer Eng., Univ. of California, Santa Barbara, Mar. 1998.