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!
cited_by
cites
container_end_page 215
container_issue 2
container_start_page 185
container_title International journal of parallel programming
container_volume 29
creator Hoeflinger, Jay P
Paek, Yunheung
Yi, Kwang
description 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.
doi_str_mv 10.1023/A:1007685003043
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_miscellaneous_743320574</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>743320574</sourcerecordid><originalsourceid>FETCH-LOGICAL-p212t-ca630fa6049378c7b688e1486a56f4e73b05b14b979afefecc4e7c8ba49d95cb3</originalsourceid><addsrcrecordid>eNpdjk1LxDAURYMoOFbXbosbV9WX78TdMDgqDLhx1iVJXyBDpq1N-_8t6MrNPXC5XA4h9xSeKDD-vH2hAFoZCcBB8AuyoVLzRisBl2QDxshGC2muyU0pJwCw2pgNaY59igm7OvUzTuM0BOyWyeV6dGtmzKmc6w5nDHMa-ltyFV0uePfHihz3r1-79-bw-fax2x6akVE2N8EpDtEpEJZrE7RXxiAVRjmpokDNPUhPhbfauogRQ1jLYLwTtrMyeF6Rx9_fVeh7wTK351QC5ux6HJbSasE5A7miIg__lqdhmfpVrmUgmGXSUP4DQRpSnA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>204292581</pqid></control><display><type>article</type><title>Unified interprocedural parallelism detection</title><source>ABI/INFORM Global</source><source>Springer Nature</source><creator>Hoeflinger, Jay P ; Paek, Yunheung ; Yi, Kwang</creator><creatorcontrib>Hoeflinger, Jay P ; Paek, Yunheung ; Yi, Kwang</creatorcontrib><description>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.</description><identifier>ISSN: 0885-7458</identifier><identifier>EISSN: 1573-7640</identifier><identifier>DOI: 10.1023/A:1007685003043</identifier><identifier>CODEN: IJPPE5</identifier><language>eng</language><publisher>New York: Springer Nature B.V</publisher><subject>Classification ; Computer programming ; Dependence ; Privatization ; Studies ; Variables</subject><ispartof>International journal of parallel programming, 2001-04, Vol.29 (2), p.185-215</ispartof><rights>Plenum Publishing Corporation 2001</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/204292581/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/204292581?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,780,784,11688,27924,27925,36060,36061,44363,74767</link.rule.ids></links><search><creatorcontrib>Hoeflinger, Jay P</creatorcontrib><creatorcontrib>Paek, Yunheung</creatorcontrib><creatorcontrib>Yi, Kwang</creatorcontrib><title>Unified interprocedural parallelism detection</title><title>International journal of parallel programming</title><description>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.</description><subject>Classification</subject><subject>Computer programming</subject><subject>Dependence</subject><subject>Privatization</subject><subject>Studies</subject><subject>Variables</subject><issn>0885-7458</issn><issn>1573-7640</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2001</creationdate><recordtype>article</recordtype><sourceid>M0C</sourceid><recordid>eNpdjk1LxDAURYMoOFbXbosbV9WX78TdMDgqDLhx1iVJXyBDpq1N-_8t6MrNPXC5XA4h9xSeKDD-vH2hAFoZCcBB8AuyoVLzRisBl2QDxshGC2muyU0pJwCw2pgNaY59igm7OvUzTuM0BOyWyeV6dGtmzKmc6w5nDHMa-ltyFV0uePfHihz3r1-79-bw-fax2x6akVE2N8EpDtEpEJZrE7RXxiAVRjmpokDNPUhPhbfauogRQ1jLYLwTtrMyeF6Rx9_fVeh7wTK351QC5ux6HJbSasE5A7miIg__lqdhmfpVrmUgmGXSUP4DQRpSnA</recordid><startdate>20010401</startdate><enddate>20010401</enddate><creator>Hoeflinger, Jay P</creator><creator>Paek, Yunheung</creator><creator>Yi, Kwang</creator><general>Springer Nature B.V</general><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>M2O</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>Q9U</scope></search><sort><creationdate>20010401</creationdate><title>Unified interprocedural parallelism detection</title><author>Hoeflinger, Jay P ; Paek, Yunheung ; Yi, Kwang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p212t-ca630fa6049378c7b688e1486a56f4e73b05b14b979afefecc4e7c8ba49d95cb3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2001</creationdate><topic>Classification</topic><topic>Computer programming</topic><topic>Dependence</topic><topic>Privatization</topic><topic>Studies</topic><topic>Variables</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hoeflinger, Jay P</creatorcontrib><creatorcontrib>Paek, Yunheung</creatorcontrib><creatorcontrib>Yi, Kwang</creatorcontrib><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>ProQuest Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Research Library</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central Basic</collection><jtitle>International journal of parallel programming</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hoeflinger, Jay P</au><au>Paek, Yunheung</au><au>Yi, Kwang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Unified interprocedural parallelism detection</atitle><jtitle>International journal of parallel programming</jtitle><date>2001-04-01</date><risdate>2001</risdate><volume>29</volume><issue>2</issue><spage>185</spage><epage>215</epage><pages>185-215</pages><issn>0885-7458</issn><eissn>1573-7640</eissn><coden>IJPPE5</coden><abstract>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.</abstract><cop>New York</cop><pub>Springer Nature B.V</pub><doi>10.1023/A:1007685003043</doi><tpages>31</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0885-7458
ispartof International journal of parallel programming, 2001-04, Vol.29 (2), p.185-215
issn 0885-7458
1573-7640
language eng
recordid cdi_proquest_miscellaneous_743320574
source ABI/INFORM Global; Springer Nature
subjects Classification
Computer programming
Dependence
Privatization
Studies
Variables
title Unified interprocedural parallelism detection
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T04%3A32%3A45IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Unified%20interprocedural%20parallelism%20detection&rft.jtitle=International%20journal%20of%20parallel%20programming&rft.au=Hoeflinger,%20Jay%20P&rft.date=2001-04-01&rft.volume=29&rft.issue=2&rft.spage=185&rft.epage=215&rft.pages=185-215&rft.issn=0885-7458&rft.eissn=1573-7640&rft.coden=IJPPE5&rft_id=info:doi/10.1023/A:1007685003043&rft_dat=%3Cproquest%3E743320574%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-p212t-ca630fa6049378c7b688e1486a56f4e73b05b14b979afefecc4e7c8ba49d95cb3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=204292581&rft_id=info:pmid/&rfr_iscdi=true