Near-optimal broadcast in all-port wormhole-routed 3D tori with dimension-ordered routing

Yu-Chee Tseng*, San Yuan Wang

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

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 torus. 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.

Original languageEnglish
Pages (from-to)253-262
Number of pages10
JournalProceedings of the Hawaii International Conference on System Sciences
Volume3
DOIs
StatePublished - 1 Jan 1998
EventProceedings of the 1998 31st Annual Hawaii International Conference on System Sciences. Part 1 (of 7) - Big Island, HI, USA
Duration: 6 Jan 19989 Jan 1998

Fingerprint Dive into the research topics of 'Near-optimal broadcast in all-port wormhole-routed 3D tori with dimension-ordered routing'. Together they form a unique fingerprint.

Cite this