By Topic

Compile-time generation of regular communications patterns

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)
Charles Koelbel ; Center for Research on Parallel Computation, Rice University, Houston, TX

A major hindrance to writing programs for distributed memory architectures has been the necessity of inserting explicit interprocessor communication. Recent work has shifted much of this detailed work from the programmer onto the compiler. In this paper, we provide explicit formulas describing the communications to be generated for an important class of computations: block-and cyclicly-distributed arrays with linear subscripts. We illustrate these methods with results from a compiler for the Kali language.

Published in:

Supercomputing, 1991. Supercomputing '91. Proceedings of the 1991 ACM/IEEE Conference on

Date of Conference:

18-22 Nov. 1991