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.
|Number of pages||10|
|Journal||Proceedings of the Hawaii International Conference on System Sciences|
|State||Published - 1 Jan 1998|
|Event||Proceedings of the 1998 31st Annual Hawaii International Conference on System Sciences. Part 1 (of 7) - Big Island, HI, USA|
Duration: 6 Jan 1998 → 9 Jan 1998