Toward optimal complete exchange on wormhole-routed tori

NCU Institutional Repository > 資訊電機學院 > 資訊工程研究所 > 期刊論文 > Item 987654321/29157

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/29157

题名:	Toward optimal complete exchange on wormhole-routed tori
作者:	Tseng,YC;Ni,SY;Sheu,JP
贡献者:	資訊工程研究所
关键词:	MULTICAST COMMUNICATION;NETWORKS;COMPUTERS;TIME
日期:	1999
上传时间:	2010-06-29 20:15:05 (UTC+8)
出版者:	中央大學
摘要:	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.
關聯:	IEEE TRANSACTIONS ON COMPUTERS
显示于类别:	[資訊工程研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	434	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing