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

Trees are a common structure to represent the inter-task communication pattern of a parallel algorithm. In this paper, we consider the embedding a complete binary tree in a star graph with the objective of minimizing congestion and dilation. We develop two embeddings: i) a congestion-free, dilation-2, load-1 embedding of a level-p binary tree, and ii) a congestion-free, dilation-2, load-2 k embedding of a level-(p+k) binary tree, into an n-dimensional star graph, where p = n i=2 blog ic = (n log n) and k is any positive integer. The rst result ooers a tree of size comparable or superior to existing results, but with less congestion and dilation. The second result provides more exibility in the embeddable tree sizes compared to existing results.

[1]  Ke Qiu.  Broadcasting on the Star and Pancake Interconnection Networks , 1995 .

[2]  Yu-Chee Tseng,et al.  Fault-tolerant ring embedding in star graphs , 1996, Proceedings of International Conference on Parallel Processing.

[3]  Khaled Day,et al.  A Comparative Study of Topological Properties of Hypercubes and Star Graphs , 1994, IEEE Trans. Parallel Distributed Syst..

[4]  Dilip Sarkar,et al.  Optimal Broadcasting on the Star Graph , 1992, IEEE Trans. Parallel Distributed Syst..

[5]  S. Lakshmivarahan,et al.  Embedding of cycles and grids in star graphs , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

[6]  Selim G. Akl,et al.  Optimal Communication algorithms on Star Graphs Using Spanning Tree Constructions , 1995, J. Parallel Distributed Comput..

[7]  Jaroslav Opatrny,et al.  Embeddings of complete binary trees into star graphs with congestion 1 , 1995, Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences.

[8]  Jelena V. Misic,et al.  Communication Aspects of the Star Graph Interconnection Network , 1994, IEEE Trans. Parallel Distributed Syst..

[9]  Burkhard Monien,et al.  Embedding one interconnection network in another , 1990 .

[10]  Abdelmadjid Bouabdallah,et al.  Embedding Complete Binary Trees into Star and Pancake Graphs , 1998, Theory of Computing Systems.

[11]  Nader Bagherzadeh,et al.  Embedding an Arbitrary Binary Tree into the Star Graph , 1996, IEEE Trans. Computers.

[12]  Jelena V. Misic,et al.  Fault Tolerance of the Star Graph Interconnection Network , 1994, Inf. Process. Lett..

[13]  Sheldon B. Akers,et al.  The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.

[14]  Sartaj Sahni,et al.  Embedding Hamiltonians and Hypercubes in Star Interconnection Graphs , 1990, ICPP.

[15]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[16]  Selim G. Akl,et al.  On Some Properties and Algorithms for the Star and Pancake Interconnection Networks , 1994, J. Parallel Distributed Comput..

[17]  Chiun-Chieh Hsu.  All-fault-tolerant embedding of a complete binary tree in a group of Cayley graphs , 1996 .

[18]  Jang-Ping Sheu,et al.  An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs , 1995, IEEE Trans. Parallel Distributed Syst..

[19]  Jang-Ping Sheu,et al.  A fault-tolerant reconfiguration scheme in the faulty star graph , 1996, Proceedings of 1996 IEEE Second International Conference on Algorithms and Architectures for Parallel Processing, ICA/sup 3/PP '96.

[20]  Abdelmadjid Bouabdallah,et al.  Embedding Complete Binary Trees into Star Networks , 1994, MFCS.