Collective communication in wormhole-routed massively parallel computers

機構典藏 > College of Engineering > Graduate Institute & Department of Computer Science and Information Engineering > Journal Article > Item 987654321/71276

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/71276

Title:	Collective communication in wormhole-routed massively parallel computers
Authors:	McKinley, P. K.;Tsai, Yih-Jia;Robinson, D. F.
Contributors:	淡江大學資訊工程學系
Date:	1995-12
Issue Date:	2011-10-24 01:01:37 (UTC+8)
Publisher:	New York: Institute of Electrical and Electronics Engineers
Abstract:	Most MPC networks use wormhole routing to reduce the effect of path length on communication time. Researchers have exploited this by designing ingenious algorithms to speed collective communication. Many projects have addressed the design of efficient collective communication algorithms for wormhole-routed systems. By exploiting the relative distance-insensitivity of wormhole routing, these new algorithms often differ fundamentally from their store-and-forward counterparts. We examine software and hardware approaches to implementing collective communication operations. Although we emphasize methods in which the underlying architecture is a direct network, such as a hypercube or mesh, as opposed to an indirect switch-based network, several approaches apply to systems of either type. We illustrate several issues arising in this research area and describe the major classes of algorithms proposed to solve these problems.
Relation:	Computer 28(12), pp.39-50
DOI:	10.1109/2.476198
Appears in Collections:	[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

Files in This Item:

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