Spanning subgraphs with applications to communication on the multidimensional torus network

Parallel Computing

Volumn 22, Issue 7, 1996, Pages 991-1015

  Fragopoulou, Paraskevi ^a   Akl, Selim G ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

Communication algorithm; Interconnection network; Multidimensional torus; Spanning subgraph

Indexed keywords

COMPUTER NETWORKS; DATA COMMUNICATION SYSTEMS; GRAPH THEORY; INTERCONNECTION NETWORKS; MATHEMATICAL MODELS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS;

BALANCED SPANNING GRAPH; BALANCED SPANNING TREE; MULTIDIMENSIONAL TORUS; MULTINODE BROADCASTING; MULTINODE SCATTERING; OPTIMAL ALGORITHMS; SINGLE NODE BROADCASTING; SINGLE NODE SCATTERING; SPANNING SUBGRAPHS;

ALGORITHMS;

EID: 0030270342     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-8191(96)00029-4     Document Type: Article

References (25)

1. S.B. Akers, D. Harel and B. Krishnamurthy, The star graph: An attractive alternative to the hypercube, in: Proc. Internat. Conf. on Parallel Processing, St. Charles, IL (1987) 393-400.
2. S.B. Akers and B. Krishnamurthy, A group theoretic model for symmetric interconnection networks, IEEE Trans. Comput. 38 (4) (1989) 555-566.
3. D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods (Prentice-Hall, Englewood Cliffs, NJ, 1989).
4. D.P. Bertsekas, C. Ozveren, G.D. Stamoulis, P. Tseng and J.N. Tsitsiklis, Optimal communication algorithms for hypercubes, J. Parallel Distributed Comput. 11 (4) (1991) 263-275.
5. L.N. Bhuyan and D.P. Agrawal, Generalized hypercube and hyperbus structures for a computer network, IEEE Trans. Comput. 33 (4) (1984) 323-333.
6. P. Fragopoulou and S.G. Akl, Optimal communication algorithms on the star interconnection network, in: Proc. IEEE Symp. on Parallel and Distributed Processing, Dallas, TX (1993) 702-711.
7. P. Fragopoulou and S.G. Akl, Optimal communication algorithms on star graphs using spanning tree constructions, J. Parallel Distributed Comput. 24 (1) (1995) 55-71.
8. P. Fragopoulou and S.G. Akl, Edge-disjoint spanning trees on the star network with applications to fault tolerance, IEEE Trans. Comput. (1995), to appear.
9. P. Fragopoulou, S.G. Akl and H. Meijer, Optimal communication primitives on the generalized hypercube network, J. Parallel Distributed Comput. (1995), to appear.
10. P. Fragopoulou and S.G. Akl, A framework for optimal communication on the multidimensional torus network, Tech. Rep. 94-363, Dept. of Computing and Information Science, Queen's University, Kingston, ON, Canada, 1994.
11. P. Fragopoulou and S.G. Akl, Spanning graphs with applications to communication on a subclass of the Cayley graph based networks, Manuscript, 1995.
12. P. Fraigniaud and E. Lazard, Methods and models of communication in usual networks, Discrete Appl. Math. 53 (1-3) (1994) 79-133.
13. P. Fraigniaud, Complexity analysis of broadcasting in hypercubes with restricted communication capabilities, J. Parallel Distributed Comput. 16 (1) (1992) 15-26.
14. L. Garding and T. Tambour, Algebra for Computer Science (Springer, Berlin, 1988).
15. P.T. Gaughan and S. Yalamanchili, Adaptive routing protocols for hypercube interconnection networks, Computer 26 (5) (1993) 12-23.
16. S.L. Johnson, Communication efficient basic linear algebra computations on hypercube architectures, J. Parallel Distributed Comput. 4 (2) (1987) 133-172.
17. S.L. Johnson and C.T. Ho, Optimum broadcasting and personalized communication in hypercubes, IEEE Trans. Comput. 38 (9) (1989) 1249-1268.
18. S. Lakshmivarahan, J.S. Jwo and S.K. Dhall, Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey, Parallel Computing 19 (4) (1993) 361-407.
19. F.T. Leighton, Complexity Issues in VLSI: Optimal Layouts for the Shuffle Exchange Graph and other Networks (MIT-Press, Cambridge, MA, 1983).
20. K.A. Ross and C.R.B. Wright, Discrete Mathematics (Prentice-Hall, Englewood Cliffs, NJ, 1985).
21. Y. Saad and M.H. Schultz, Data communication in parallel architectures, Parallel Computing 11 (2) (1989) 131-150.
22. Y. Saad and M.H. Schultz, Data communication in hypercubes, J. Parallel Distributed Comput. 6 (1989) 115-135.
23. Q.F. Stout and B. Wagar, Intensive hypercube communication, J. Parallel Distributed Comput. 10 (2) (1993) 167-181.
24. E.A. Varvarigos and D.P. Bertsekas, Communication algorithms for isotropic tasks in hypercubes and wraparound meshes, Parallel Computing 18 (11) (1992) 1233-1257.
25. E.A. Varvarigos and D.P. Bertsekas, Partial multinode broadcast and partial exchange algorithms for d-dimensional meshes, J. Parallel Distributed Comput. 23 (2) (1994) 177-189.