Advanced Search

Journal Navigation

Journal Home

Subscriptions

Archive

Contact Us

Table of Contents

Click here to sign up for SAGE Journal Email Alerts today!

Sign In to gain access to subscriptions and/or personal tools.
International Journal of High Performance Computing Applications
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to Saved Citations
Right arrow Download to citation manager
Right arrowRequest Permissions
Right arrow Request Reprints
Right arrow Add to My Marked Citations
Citing Articles
Right arrow Citing Articles via Google Scholar
Right arrow Citing Articles via Scopus
Google Scholar
Right arrow Articles by Bouchitté, V.
Right arrow Articles by Robert, Y.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Complore   Add to Connotea   Add to Del.icio.us   Add to Digg   Add to Reddit   Add to Technorati   Add to Twitter  
What's this?

Evaluating Array Expressions On Massively Parallel Machines With Communication/ Computation Overlap

Vincent Bouchitté

LABORATOIRE LIP, CNRS (U.R.A. N° 1398) ECOLE NORMALE SUPERIEURE DE LYON LYON CEDEX, FRANCE

Pierre Boulet

LABORATOIRE LIP, CNRS (U.R.A. N° 1398) ECOLE NORMALE SUPERIEURE DE LYON LYON CEDEX, FRANCE

Alain Darte

LABORATOIRE LIP, CNRS (U.R.A. N° 1398) ECOLE NORMALE SUPERIEURE DE LYON LYON CEDEX, FRANCE

Yves Robert

LABORATOIRE LIP, CNRS (U.R.A. N° 1398) ECOLE NORMALE SUPERIEURE DE LYON LYON CEDEX, FRANCE

This paper deals with the problem of evaluating High Performance Fortran (HPF) style array expressions on massively parallel distributed-memory computers (DMPCs). This problem has been addressed by Chat terjee et al., 1992, 1993 under the strict hypothesis that computations and communications cannot overlap. As such a model appears to be unnecessarily restrictive for modeling state-of-the-art DMPCs, we relax the re striction and allow for simultaneous computations and communications. This simple modification has a tre mendous effect on the complexity of the optimal eval uation of array expressions. We first show that even a simple version of the problem is NP-complete. Then, we present some heuristics that we can guarantee in some important cases in practice, namely, for coarse- grain or fine-grain computations.

International Journal of High Performance Computing Applications, Vol. 9, No. 3, 205-219 (1995)
DOI: 10.1177/109434209500900303
Add to CiteULike CiteULike   Add to Complore Complore   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us   Add to Digg Digg   Add to Reddit Reddit   Add to Technorati Technorati   Add to Twitter Twitter    What's this?