Runtime compilation techniques for data partitioning and communication schedule reuse

Ravi Ponusamy*, Joel Slatz, Alok Choudhary

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

41 Scopus citations

Abstract

In this paper, we describe two new ideas by which HPF compiler can deal with irregular computations effectively. The first mechanism invokes a user specified mapping procedure via a set of compiler directives. The directives allow the user to use program arrays to describe graph connectivity, spatial location of array elements and computational load. The second is a simple conservative method that in many cases enables a compiler to recognize that it is possible to reuse previously computed results from inspectors (e.g. communication schedules, loop interation partitions, information that associated off-processor data copies with on-processor buffer locations). We present performance results for these mechanisms from a Fortran 90D compiler implementation.

Original languageEnglish (US)
Title of host publicationProceedings of the Supercomputing Conference
Editors Anon
Pages361-370
Number of pages10
DOIs
StatePublished - Dec 1 1993
EventProceedings of the Supercomputing '93 Conference - Portland, OR, USA
Duration: Nov 15 1993Nov 19 1993

Publication series

NameProceedings of the Supercomputing Conference
ISSN (Print)1063-9535

Other

OtherProceedings of the Supercomputing '93 Conference
CityPortland, OR, USA
Period11/15/9311/19/93

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Runtime compilation techniques for data partitioning and communication schedule reuse'. Together they form a unique fingerprint.

Cite this