By Topic

An interprocedural framework for determining efficient data redistributions in distributed memory machines

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

2 Author(s)
S. K. S. Gupta ; Dept. of Comput. Sci., Colorado State Univ., Fort Collins, CO, USA ; S. Krishnamurthy

This paper presents a framework to find good distributions for the global arrays at different program points in the presence of procedure calls. The distributions are chosen for their ability to offset the re-distribution overheads by contributing significantly towards increasing the performance gains. The algorithm uses interprocedural analysis and dynamic programming techniques. The working of the algorithm has been demonstrated for a CFD kernel.

Published in:

Frontiers of Massively Parallel Computing, 1996. Proceedings Frontiers '96., Sixth Symposium on the

Date of Conference:

27-31 Oct. 1996