Runtime compilation techniques for data partitioning and communication schedule reuse

Ravi Ponusamy; Joel Slatz; Alok Choudhary

doi:10.1109/SUPERC.1993.1263480

Runtime compilation techniques for data partitioning and communication schedule reuse

Ravi Ponusamy^*, Joel Slatz, Alok Choudhary

^*Corresponding author for this work

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

42 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 language	English (US)
Title of host publication	Proceedings of the Supercomputing Conference
Publisher	Publ by IEEE
Pages	361-370
Number of pages	10
ISBN (Print)	0818643404, 9780818643408
DOIs	https://doi.org/10.1109/SUPERC.1993.1263480
State	Published - 1993
Event	Proceedings of the Supercomputing '93 Conference - Portland, OR, USA Duration: Nov 15 1993 → Nov 19 1993

Publication series

Name	Proceedings of the Supercomputing Conference
ISSN (Print)	1063-9535

Other

Other	Proceedings of the Supercomputing '93 Conference
City	Portland, OR, USA
Period	11/15/93 → 11/19/93

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1109/SUPERC.1993.1263480

Cite this

@inproceedings{b935f5c923b14ed5805d569ea110b7dc,

title = "Runtime compilation techniques for data partitioning and communication schedule reuse",

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.",

author = "Ravi Ponusamy and Joel Slatz and Alok Choudhary",

year = "1993",

doi = "10.1109/SUPERC.1993.1263480",

language = "English (US)",

isbn = "0818643404",

series = "Proceedings of the Supercomputing Conference",

publisher = "Publ by IEEE",

pages = "361--370",

booktitle = "Proceedings of the Supercomputing Conference",

note = "Proceedings of the Supercomputing '93 Conference ; Conference date: 15-11-1993 Through 19-11-1993",

}

Ponusamy, R, Slatz, J & Choudhary, A 1993, Runtime compilation techniques for data partitioning and communication schedule reuse. in Proceedings of the Supercomputing Conference. Proceedings of the Supercomputing Conference, Publ by IEEE, pp. 361-370, Proceedings of the Supercomputing '93 Conference, Portland, OR, USA, 11/15/93. https://doi.org/10.1109/SUPERC.1993.1263480

TY - GEN

T1 - Runtime compilation techniques for data partitioning and communication schedule reuse

AU - Ponusamy, Ravi

AU - Slatz, Joel

AU - Choudhary, Alok

PY - 1993

Y1 - 1993

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0027735065&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027735065&partnerID=8YFLogxK

U2 - 10.1109/SUPERC.1993.1263480

DO - 10.1109/SUPERC.1993.1263480

M3 - Conference contribution

AN - SCOPUS:0027735065

SN - 0818643404

SN - 9780818643408

T3 - Proceedings of the Supercomputing Conference

SP - 361

EP - 370

BT - Proceedings of the Supercomputing Conference

PB - Publ by IEEE

T2 - Proceedings of the Supercomputing '93 Conference

Y2 - 15 November 1993 through 19 November 1993

ER -

Runtime compilation techniques for data partitioning and communication schedule reuse

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this