A theory for total exchange in multidimensional interconnection networks

IEEE Transactions on Parallel and Distributed Systems

Volumn 9, Issue 7, 1998, Pages 639-649

  Dimakopoulos, Vassilios V ^a,b   Dimopoulos, Nikitas J ^a,c  

^a IEEE   (Greece)

^b UNIVERSITY OF IOANNINA   (Greece)

^c UNIVERSITY OF VICTORIA   (Canada)

Author keywords

Collective communications; Interconnection networks; Multidimensional networks; Packet switched networks; Total exchange

Indexed keywords

DATA COMMUNICATION SYSTEMS; DATA STORAGE EQUIPMENT; ELECTRIC NETWORK TOPOLOGY; INFORMATION DISSEMINATION; MATHEMATICAL MODELS; MULTIPROCESSING SYSTEMS; OPTIMIZATION; PACKET NETWORKS; STORAGE ALLOCATION (COMPUTER);

DISTRIBUTED MEMORY MULTIPROCESSORS; MULTIDIMENSIONAL INTERCONNECTION NETWORKS;

INTERCONNECTION NETWORKS;

EID: 0032121153     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.707541     Document Type: Article

References (26)

1. 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.
2. D.P. Bertsekas, C. Ozveren, G.D. Stamoulis, P. Tseng, and J.N. Tsitsiklis, "Optimal Communication Algorithms for Hypercubes," J. Parallel and Distributed Computing, vol. 11, pp. 263-275, 1991.
3. D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Englewood Cliffs, N.J.: Prentice Hall, 1989.
4. 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.
5. F. Buckley and F. Harary, Distance in Graphs. Reading, Mass.: Addison-Wesley, 1990.
6. W.J. Dally and C.L. Seitz, "Deadlock-Free Message Routing in Multiprocessor Interconnection Networks," IEEE Trans. Computers, vol. 36, no. 5, pp. 547-553, May 1987.
7. V.V. Dimakopoulos and N.J. Dimopoulos, "Optimal Total Exchange in Linear Arrays and Rings," Proc. ISPAN'94 Int'l Symp. Parallel Architecture, Algorithms, and Networks, pp. 230-237, Kanazawa, Japan, Dec. 1994.
8. V.V. Dimakopoulos and N.J. Dimopoulos, "Optimal Total Exchange in Cayley Networks," Proc. EUROPAR'96, European Conf. Parallel Processing, pp. 340-346, Lyon, France, Aug. 1996.
9. K. Efe and A. Fernández, "Products of Networks With Logarithmic Diameter and Fixed Degree," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 9, pp. 963-975, Sept. 1995.
10. P. Fraigniaud and E. Lazard, "Methods and Problems of Communication in Usual Networks," Discrete Applied Math., vol. 53, pp. 79-133, 1994.
11. D.B. Gannon and J. van Rosendale, "On the Impact of Communication Complexity on the Design of Parallel Numerical Algorithms," IEEE Trans. Computers, vol. 33, no. 12, pp. 1,180-1,194, Dec. 1984.
12. E. Ganesan and D.K. Pradhan, "The Hyper-deBruijn Network: Scalable Versatile Architecture," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 9, pp. 962-978, Sept. 1993.
13. S. Hiranandani, K. Kennedy and C.-W. Tseng, "Compiling Fortran D for MIMD Distributed-Memory Machines," Comm. ACM, vol. 35, no. 8, pp. 66-80, Aug. 1992.
14. S.L. Johnsson, "Communication Efficient Basic Linear Algebra Computations on Hypercube Architectures," J. Parallel and Distributed Computing, vol. 4, pp. 133-172, 1987.
15. 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.
16. F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. San Diego, Calif.: Morgan Kaufmann, 1992.
17. D.B. Loveman, "High Performance Fortran," IEEE Parallel and Distributed Technology, vol. 1, pp. 25-42, Feb. 1993.
18. P.K. McKinley, Y.-J. Tsai, and D.F. Robinson, "Collective Communication in Wormhole-Routed Massively Parallel Computers," Computer, vol. 28, no. 12, pp. 39-50, Dec. 1995.
19. Message Passing Interface Forum, "MPI: A Message-Passing Interface Standard," Technical Report CS-94-230, Univ. of Tennessee, Apr. 1994.
20. J. Missic 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.
21. S. Öhring and S.K. Das, "Folded Petersen Cube Networks: New Competitors for the Hypercubes," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 2, pp. 151-168, Feb. 1996.
22. D.A. Reed and D.C. Grunwald, "The Performance of Multicomputer Interconnection Networks," Computer, vol. 20, no. 6, pp. 63-73, June 1987.
23. A.L. Rosenberg, "Product-Shuffle Networks: Towards Reconciling Shuffles and Butterflies," Discrete Applied Math., vol. 37/38, pp. 465-488, July 1992.
24. Y. Saad and M.H. Schultz, "Data Communications in Hypercubes," J. Parallel and Distributed Computing, vol. 6, pp. 115-135, 1989.
25. E.A. Varvarigos and D.P Bertsekas, "Communication Algorithms for Isotropic Tasks in Hypercubes and Wraparound Meshes," Parallel Computing, vol. 18, pp. 1,233-1,257, 1992.
26. A.S. Youssef and B. Narahari, "The Banyan-Hypercube Networks," IEEE Trans. Parallel and Distributed Systems, vol. 1, no. 2, pp. 160-169, Apr. 1990.