Toward optimal complete exchange on wormhole-routed tori

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

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

Title:	Toward optimal complete exchange on wormhole-routed tori
Authors:	Tseng,YC;Ni,SY;Sheu,JP
Contributors:	資訊工程研究所
Keywords:	MULTICAST COMMUNICATION;NETWORKS;COMPUTERS;TIME
Date:	1999
Issue Date:	2010-06-29 20:15:05 (UTC+8)
Publisher:	中央大學
Abstract:	In this paper, we propose new routing schemes to perform all-to-all personalized communication (or known as complete exchange) in wormhole-routed, one-port tori. On tori of equal size along each dimension, our algorithms use both asymptotically optimal startup and transmission time. The results are characterized by several interesting features: I)the use of gather-scatter tree to achieve optimality in startup time, 2) enforcement of shortest paths in routing messages to achieve optimality in transmission time, 3) application of network-partitioning techniques to reduce the constant associated with the transmission time, and 4) the dimension-by-dimension and gather-scatter-tree approach to make possible applying the results to nonsquare, any-size tori. In the literature, some algorithms are optimal in only one of startup and transmission costs, while some, although asymptotically optimal in both costs, will incur much larger constants associated with the costs. Numerical analysis and experiment both show that significant improvement can be obtained by our scheme on total communication latency over existing results.
Relation:	IEEE TRANSACTIONS ON COMPUTERS
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	422	View/Open

社群 sharing

Loading...