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

Yu-Chee Tseng*, Yuh Shyan Chen, Tong Ying Juang, Chiou Jyu Chang

*Corresponding author for this work

研究成果: Article

19 引文 斯高帕斯(Scopus)

摘要

Trees are a common structure to represent the intertask communication pattern of a parallel algorithm. In this paper, we consider the embedding of 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-2k embedding of a level-(p + k) binary tree, into an n-dimensional star graph, where p = Σni-2 [log i] = Ω(n log n) and k is any positive integer. The first result offers a tree of size comparable or superior to existing results, but with less congestion and dilation. The second result provides more flexibility in the embeddable tree sizes compared to existing results.

原文English
頁(從 - 到)221-231
頁數11
期刊Networks
33
發行號3
DOIs
出版狀態Published - 1 一月 1999

指紋 深入研究「Congestion-free, dilation-2 embedding of complete binary trees into star graphs」主題。共同形成了獨特的指紋。

  • 引用此