Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Nearly optimal algorithms for broadcast on d-dimensional all-port and wormhole-routed torus

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jyh-Jong Tsay ; Dept. of Comput. Sci. & Inf. Eng., Nat. Chung Cheng Univ., Chiayi, Taiwan ; Wen-Tsong Wang

We present nearly optimal algorithms for broadcast on a d-dimensional n×n x...x n torus that supports all-port communication and wormhole routing. Let T(n) denote the number of communication steps performed to broadcast a message. We present algorithms that achieve the following performance: (i) T(n)=d[log2d+1n]+1 when n is odd, and (ii) T(n)=d[log2d+1(n-1)]+[d/2]+1 when n is even. The lower bound is [dlog2d+1n]. Our algorithm is the first one that works for arbitrary n, and is optimal up to the constant term. Previous algorithms with comparable performance only work for the case that either d is 2 or 3, or n is a power of 2d+1. For special cases such as d=2 or 3, we can improve the algorithm so that T(n)=d[log2d+1n] for any n

Published in:

Parallel Processing Symposium, 1998. IPPS/SPDP 1998. Proceedings of the First Merged International ... and Symposium on Parallel and Distributed Processing 1998

Date of Conference:

30 Mar-3 Apr 1998