By Topic

Optimal all-to-some personalized communication on hypercubes

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

1 Author(s)
Hu, Y.C. ; Dept. of Comput. Sci., Rice Univ., Houston, TX, USA

In a hypercube multiprocessor with distributed memory, each data element has a street address and an apartment number (i.e. a hypercube node address and a local memory address). We describe an optimal algorithm for performing the all-to-some personalized communication (ASPC) on Boolean n-cubes, defined as (i|j)→(i±2j|j), i∈[0,2n-1], j∈[0,n-1], where (i|j) denote the data element on node i and location j. The algorithm also gives an optimal schedule for emulating PM2I networks on hypercubes under the binary-reflected Gray code encoding. We also study an important class of parallel algorithms, called ±2b-descend, which perform log M iterations on an M-element input a[O:M-1]. For b=log M-1,...,0, iteration b computes new values of each a[i] as a function of a[i], a[i+2b], a[i-2 b]. For large applications, the problem size M is typically much larger than the number of nodes N. We show that on hypercubes, the optimal ASPC algorithm devised in this paper can be used in combination with pipelining communication and computation in ±2b-descend computations to reduce the communication steps from 2.log N.M/N to 4(log M+M/N-1). At one communication step, a hypercube node can send n elements along its n links, one per link

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