Paper Info
Title
Near-optimal broadcast in all-port wormhole-routed 3D tori with dimension-ordered routing
Abstract
The one-to-all broadcast is the most primary operation in a multicomputer network. In this paper we study this problem in a wormhole-routed 3D torus which provides the dimension-ordered routing and the all-port communication capability. We propose an efficient scheme to utilize the distance-insensitive characteristic of wormhole routing. The scheme requires at most 4 steps more than the optimal number of steps for any square 3D tools. The best known results, as compared to ours, can only be applied to cubic tori of very restricted network sizes and either rely on an undesirable non-dimension-ordered routing or require more numbers of steps
Year
DOI
Venue
1998
10.1109/HICSS.1998.656273
HICSS (3)
Keywords
Field
DocType
all-port communication capability,collective communication,efficient scheme,network routing,multiprocessor interconnection networks,one-to-all broadcast,restricted network size,cubic torus,3d tori,undesirable non-dimension-ordered routing,wormhole routing,all-port communication,wormhole-routed,torus,interconnection network,parallel process- ing,multicomputer network,wormhole routing.,distance-insensitive characteristic,near-optimal broadcast,known result,all-port wormhole-routed,dimension-ordered routing,3d torus,computer science,linear algebra,parallel processing,broadcasting,routing,computer worms
Link-state routing protocol,Multipath routing,Dynamic Source Routing,Policy-based routing,Static routing,Computer science,Routing domain,Computer network,Routing Information Protocol,Routing table
Conference
Volume
ISSN
ISBN
3
1060-3425
0-8186-8255-8
Citations 
PageRank 
References 
0
0.34
10
Authors
2
Name
Order
Citations
PageRank
Yu-Chee Tseng16603639.67
San-Yuan Wang21007.99