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

NCUIR > College of Electrical Engineering & Computer Science > Graduate Institute of Computer Science and Information Engineering > journal & Dissertation > Item 987654321/29147

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/29147

Title:	Congestion-free, dilation-2 embedding of complete binary trees into star graphs
Authors:	Tseng,YC;Chen,YS;Juang,TY;Chang,CJ
Contributors:	資訊工程研究所
Keywords:	INTERCONNECTION NETWORK
Date:	1999
Issue Date:	2010-06-29 20:14:50 (UTC+8)
Publisher:	中央大學
Abstract:	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-2(k) embedding of a level-(p + k) binary tree, into an n-dimensional star graph, where p = Sigma(i=2)(n) [log i] = Omega(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. (C) 1999 John Wiley & Sons, Inc.
Relation:	NETWORKS
Appears in Collections:	[Graduate Institute of Computer Science and Information Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	378	View/Open

社群 sharing