By Topic

Efficient algorithms for data distribution on distributed memory multicomputers

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
$33 $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)
PeiZong Lee ; Inst. of Inf. Sci., Acad. Sinica, Taipei, Taiwan

Data distribution has been one of the most important research topics in parallelizing compilers for distributed memory parallel computers. In this paper, we show that data re-distribution is necessary for executing a sequence of Do-loops if the communication cost due to perform this sequence of Do-loops is larger than a threshold value. Based on this observation, we propose efficient algorithms which can determine effective data distribution schema for executing a sequence of Do-loops with a general structure. Our result contributes towards automatic compilation of sequential programs to message-passing version programs running on distributed memory parallel computers

Published in:

Parallel and Distributed Systems, 1994. International Conference on

Date of Conference:

19-22 Dec 1994