Unified interprocedural parallelism detection

A new way of detecting parallelism interprocedurally within a program. This method goes beyond mere dependence testing to embrace methods of removing dependences as well, namely privitazation, induction recognition and reduction recognition. This method is based on a combination of techniques: a uni...

Full description

Saved in:
Bibliographic Details
Published in:International journal of parallel programming 2001-04, Vol.29 (2), p.185-215
Main Authors: Hoeflinger, Jay P, Paek, Yunheung, Yi, Kwang
Format: Article
Language:English
Subjects:
Classification
Computer programming
Dependence
Privatization
Studies
Variables
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A new way of detecting parallelism interprocedurally within a program. This method goes beyond mere dependence testing to embrace methods of removing dependences as well, namely privitazation, induction recognition and reduction recognition. This method is based on a combination of techniques: a universal form for representing memory accesses within a section of code (the Linear Memory Access Descriptor), a technique for classifying memory locations based on the accesses made to them by the code (Memory Classification Analysis), and a dependence test (the Access Region Test). The analysis done with Linear Memory Access Descriptors is based on an intersection operation, for which an algorithm is presented. Linear Memory Access Descriptors are independent of any declarations that may exist in a program, so they are subroutine- and language-independent. This makes them ideal for use in interprocedural analysis.
ISSN:0885-7458
1573-7640
DOI:10.1023/A:1007685003043