Congestion-free, dilation-2 embedding of complete binary trees into star graphs

Networks

Volumn 33, Issue 3, 1999, Pages 221-231

  Tseng, Yu Chee ^a   Chen, Yuh Shyan ^b   Juang, Tong Ying ^b   Chang, Chiou Jyu ^b  

^a NATIONAL CENTRAL UNIVERSITY   (Taiwan)

^b CHUNG HUA UNIVERSITY   (Taiwan)

Author keywords

Complete binary tree; Graph embedding; Interconnection network; Parallel processing; Star graph

Indexed keywords

EID: 0033130516     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199905)33:3<221::AID-NET8>3.0.CO;2-K     Document Type: Article

References (25)

1. [1] S.B. Akers, D. Harel, and B. Krishnameurthy, The star graph: An attractive alternative to the n-cube, Proc International Conference on Parallel Processing, Aug. 1987, pp. 393-400.
2. [2] S.B. Akers and B. Krishnameurthy, Group-theoretic model for symmetric interconnection networks, IEEE Trans Comput 38 (1989), 555-565.
3. [3] N. Bagherzadeh, M. Dowd, and N. Nassif, Embedding an arbitrary binary tree into star graph, IEEE Trans Comput 45 (1996), 475-481.
4. [4] N. Bagherzadeh, N. Nassif, and S. Latifi, A routing and broadcasting scheme on faulty star graphs, IEEE Trans Comput 42 (1993), 1398-1403.
5. [5] A. Bouabdallah, M.C. Heydemann, J. Opatrny, and D. Sotteau, Embedding complete binary tress into star graphs, Proc Conference on the Mathematical Foundation of Computer Science, Lecture Notes in Computer Science 841 (1994), pp. 266-275.
6. [6] A. Bouabdallah, M.C. Heydemann, J. Opatrny, and D. Sotteau, Embedding complete binary trees into star and pancake graphs, Theory Comput Syst 31 (1998), 279-305.
7. [7] Y.-S. Chen and J.-P. Sheu, A fault-tolerant reconfiguration scheme in the faulty star graph. Proc Second International Conference on Algorithms & Architectures for Parallel Processing, June 1996, pp. 241-248.
8. [8] Y.-S. Chen, J.-P. Sheu, and Y.-C. Tseng, Toward optimal ring embedding in the faulty star graph. Proc Fourth International Conference on Parallel and Distributed Processing Techniques and Applications, July 1998, pp. 629-636.
9. [9] K. Day and A. Tripathi, A comparative study of topological properties of hypercubes and star graphs, IEEE Trans Parallel Distrib Syst 5 (1994), 31-38.
10. [10] P. Fragopoulou and S.G. Akl, Optimal communication algorithms on star graphs using spanning tree constructions, J Parallel Distrib Comput 24 (1995), 55-71.
11. [11] M.-C. Heydemann, J. Opatrny, and D. Sotteau, Embeddings of complete binary trees into star graphs with congestion 1, Proc 28th Annual Hawaii International Conference on System Sciences, (1995), pp. 546-554.
12. [12] C.-C. Hsu, All-fault-tolerant embedding of a complete binary tree in a group of cayley graphs, IEE Proc-Comput Digit Tech 143 (1996), 156-160.
13. [13] Z. Jovanović and J. Mišić, Fault tolerance of the star graph interconnection network, Info Process Lett 49 (1994), 145-150.
14. [14] J.-S. Jwo, S. Lakshmivarahan, and S.K. Dhall, Embeddings of cycles and grids in star graphs, Proc Symp Parallel Distrib Process (1990), pp. 540-547.
15. [15] S. Latifi, On the fault-diameter of the star graph, Info Process Lett 46 (1993), 143-150.
16. [16] J. Lee and J. Chang, Embedding complete binary trees in star graphs, J Kor Info Sci Soc 21 (1994), 407-415.
17. [17] F.T. Leighton, Introduction to parallel algorithms and architectures: Arrays-trees-hypercubes, Morgan Kaufmann, San Mateo, CA, 1992.
18. [18] V.E. Mendia and D. Sarkar, Optimal broadcasting on the star graph, IEEE Trans Parallel Distrib Syst 3 (1992), 389-396.
19. [19] J. Mišić and Z. Jovanović, Communication aspects of the star graph interconnection network, IEEE Trans Parallel Distrib Syst 5 (1994), 678-687.
20. [20] B. Monien and H. Sudborough, Embedding one interconnection network in another, Comput Suppl 7 (1990), 257-282.
21. [21] M. Nigam, S. Sahni, and B. Krishnamurthy, Embedding Hamiltonians and hypercubes in star interconnection network, Proc International Conference on Parallel Processing, vol. III, (1990), pp. 340-343.
22. [22] K. Qiu, Broadcasting on the star and pancake interconnection networks, Proc International Parallel Processing Symposium, (1995), pp. 660-665.
23. [23] K. Qiu, S.G. Akl, and H. Meijer, On some properties and algorithms for the star and pancake interconnection networks, J Parallel Distrib Comput 22 (1994), 16-25.
24. [24] J.-P. Sheu, C.-T. Wu, and T.-S. Chen, An optimal broadcasting algorithm without message redundancy in star graphs, IEEE Trans Parallel Distrib Syst 6 (1995), 653-658.
25. [25] Y.-C. Tseng, S.-H. Chang, and J.-P. Sheu, Fault tolerant ring embedding in star graphs, IEEE Trans Parallel Distrib Syst 8 (1997), 1185-1195.