CaltechAUTHORS
  A Caltech Library Service

Detecting coarse-grain parallelism using an interprocedural parallelizing compiler

Hall, Mary W. and Amarasinghe, Saman P. and Murphy, Brian R. and Liao, Shih-Wei and Lam, Monica S. (1995) Detecting coarse-grain parallelism using an interprocedural parallelizing compiler. In: Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing. ACM , New York, NY, Art. No. 49. ISBN 0-89791-816-9. https://resolver.caltech.edu/CaltechAUTHORS:20161102-134346400

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20161102-134346400

Abstract

This paper presents an extensive empirical evaluation of an interprocedural parallelizing compiler, developed as part of the Stanford SUIF compiler system. The system incorporates a comprehensive and integrated collection of analyses, including privatization and reduction recognition for both array and scalar variables, and symbolic analysis of array subscripts. The interprocedural analysis framework is designed to provide analysis results nearly as precise as full inlining but without its associated costs. Experimentation with this system shows that it is capable of detecting coarser granularity of parallelism than previously possible. Specifically, it can parallelize loops that span numerous procedures and hundreds of lines of codes, frequently requiring modifications to array data structures such as privatization and reduction transformations. Measurements from several standard benchmark suites demonstrate that an integrated combination of interprocedural analyses can substantially advance the capability of automatic parallelization technology.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
http://dx.doi.org/10.1145/224170.224337DOIArticle
http://dl.acm.org/citation.cfm?doid=224170.224337PublisherArticle
Additional Information:© 1995 ACM. This research was supported in part by the Air Force Material Command and ARPA contract F30602-95-C-0098, ARPA contract DABT63-94-C-0054, an NSF CISE postdoctoral fellowship, Jet Propulsion Laboratory, fellowships from Intel Corporation and AT&T Bell Laboratories, and an NSF Young Investigator Award.
Funders:
Funding AgencyGrant Number
Air Force Material CommandUNSPECIFIED
Advanced Research Projects Agency (ARPA)F30602-95-C-0098
Advanced Research Projects Agency (ARPA)DABT63-94-C-0054
NSFUNSPECIFIED
JPLUNSPECIFIED
Intel CorporationUNSPECIFIED
AT&T Bell LaboratoriesUNSPECIFIED
Record Number:CaltechAUTHORS:20161102-134346400
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20161102-134346400
Official Citation:Mary H. Hall, Saman P. Amarasinghe, Brian R. Murphy, Shih-Wei Liao, and Monica S. Lam. 1995. Detecting coarse-grain parallelism using an interprocedural parallelizing compiler. In Proceedings of the 1995 ACM/IEEE conference on Supercomputing (Supercomputing '95). ACM, New York, NY, USA, , Article 49 . DOI=http://dx.doi.org/10.1145/224170.224337
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:71679
Collection:CaltechAUTHORS
Deposited By: Kristin Buxton
Deposited On:02 Nov 2016 23:37
Last Modified:03 Oct 2019 16:10

Repository Staff Only: item control page