On edge-disjoint spanning trees in hypercubes

Information Processing Letters

Volumn 70, Issue 1, 1999, Pages 13-16

  Barden, Benjamin ^a   Libeskind Hadas, Ran ^a   Davis, Janet ^a   Williams, William ^a  

^a HARVEY MUDD COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; INTERCONNECTION NETWORKS; MULTICASTING; POLYNOMIALS; THEOREM PROVING; TREES (MATHEMATICS);

MULTICAST ROUTING ALGORITHMS;

PARALLEL PROCESSING SYSTEMS;

EID: 0033574357     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(99)00033-2     Document Type: Article

References (13)

1. B. Alspach, J. Bermond, D. Sotteau, Decomposition into cycles I: Hamiltonian decomposition, in: G. Hahn, G. Sabidussi, R. Woodrow (Eds.), Cycles and Rays, NATO Science Series C: Mathematical and Physical Sciences, Vol. 301, Kluwer Academic Publishers, 1989, pp. 9-18.
2. J. Aubert, Decomposition de la somme Cartesienne d'un cycle et de l'union de deux cycles Hamiltoniens en cycles Hamiltonians, Discrete Math. 38 (1982) 7-16.
3. J. Bruck, On optimal broadcasting in faulty hypercubes, Discrete Appl. Math. 53 (1994) 3-13.
4. J. Hayes, T. Mudge, Q. Stout, S. Colley, J. Palmer, Architecture of a hypercube supercomputer, in: Proc. Internat. Conf. on Parallel Processing, 1986, pp. 653-660.
5. S. Johnsson, C.-T. Ho, Broadcasting and personalized communication in hypercubes. IEEE Trans. Comput. 38 (9) (1989) 1249-1268.
6. F.T. Leighton, Parallel Algorithms and Architectures: Arrays, Trees, and Hypercubes, Morgan Kaufmann, San Mateo, CA, 1992.
7. X. Li, P. McKinley, L. Ni, Deadlock-free multicast wormhole routing in 2D mesh multicomputers, IEEE Trans. Parallel Distrib. Systems 5 (8) (1994) 793-804.
8. R. Libeskind-Hadas, D. Mazzoni, R. Rajagopalan, Tree-based multicasting in wormhole-routed irregular topologies, in: Proc. Merged 12th Internat. Parallel Processing Symp. and the 9th Symp. on Parallel and Distributed Processing, April 1998, pp. 244-249.
9. L. Ni, P. McKinley, A survey of wormhole routing techniques in direct networks. IEEE Comput. 26 (2) (1993) 62-76.
10. J. Roskind, R. Tarjan, A note on finding minimum cost edge-disjoint spanning trees, Math. Oper. Res. 10 (1985) 701-708.
11. S. Song, Towards a simple construction for Hamiltonian decomposition of the hypercube, in: DIMACS Series Discrete Mathematics and Theoretical Computer Science, Vol. 21, Amer. Math. Soc., Providence, RI, 1995, pp. 297-306.
12. C. Stunkel, R. Sivaram, D. Panda, Implementing multidestination worms in switch-based parallel systems: Architectural alternatives and their impact, in: Proc. 24th ACM Annual International Symposium on Computer Architecture, June 1997.
13. H. Wang, D. Blough, Tree-based multicast in wormhole-routed torus networks, in: Proc. Internat. Conf. on Parallel and Distributed Processing Techniques and Applications, July 1998.