Handle URI:
http://hdl.handle.net/10754/597290
Title:
A Hybrid Approach to Proving Memory Reference Monotonicity
Authors:
Oancea, Cosmin E.; Rauchwerger, Lawrence
Abstract:
Array references indexed by non-linear expressions or subscript arrays represent a major obstacle to compiler analysis and to automatic parallelization. Most previous proposed solutions either enhance the static analysis repertoire to recognize more patterns, to infer array-value properties, and to refine the mathematical support, or apply expensive run time analysis of memory reference traces to disambiguate these accesses. This paper presents an automated solution based on static construction of access summaries, in which the reference non-linearity problem can be solved for a large number of reference patterns by extracting arbitrarily-shaped predicates that can (in)validate the reference monotonicity property and thus (dis)prove loop independence. Experiments on six benchmarks show that our general technique for dynamic validation of the monotonicity property can cover a large class of codes, incurs minimal run-time overhead and obtains good speedups. © 2013 Springer-Verlag.
Citation:
Oancea CE, Rauchwerger L (2013) A Hybrid Approach to Proving Memory Reference Monotonicity. Lecture Notes in Computer Science: 61–75. Available: http://dx.doi.org/10.1007/978-3-642-36036-7_5.
Publisher:
Springer Science + Business Media
Journal:
Languages and Compilers for Parallel Computing
KAUST Grant Number:
KUS-C1-016-04
Issue Date:
2013
DOI:
10.1007/978-3-642-36036-7_5
Type:
Book Chapter
ISSN:
0302-9743; 1611-3349
Sponsors:
This research was supported in part by NSF awards CRI-0551685, CCF-0833199, CCF-0830753, IIS-096053, IIS-0917266, NSF/DNDOaward 2008-DN-077-ARI018-02,by the DOE NNSA under the Predictive ScienceAcademic Alliances Program by grant DE-FC52-08NA28616, by by Chevron,IBM, Intel, Oracle/Sun and by Award KUS-C1-016-04, made by King AbdullahUniversity of Science and Technology (KAUST).
Appears in Collections:
Publications Acknowledging KAUST Support

Full metadata record

DC FieldValue Language
dc.contributor.authorOancea, Cosmin E.en
dc.contributor.authorRauchwerger, Lawrenceen
dc.date.accessioned2016-02-25T12:29:56Zen
dc.date.available2016-02-25T12:29:56Zen
dc.date.issued2013en
dc.identifier.citationOancea CE, Rauchwerger L (2013) A Hybrid Approach to Proving Memory Reference Monotonicity. Lecture Notes in Computer Science: 61–75. Available: http://dx.doi.org/10.1007/978-3-642-36036-7_5.en
dc.identifier.issn0302-9743en
dc.identifier.issn1611-3349en
dc.identifier.doi10.1007/978-3-642-36036-7_5en
dc.identifier.urihttp://hdl.handle.net/10754/597290en
dc.description.abstractArray references indexed by non-linear expressions or subscript arrays represent a major obstacle to compiler analysis and to automatic parallelization. Most previous proposed solutions either enhance the static analysis repertoire to recognize more patterns, to infer array-value properties, and to refine the mathematical support, or apply expensive run time analysis of memory reference traces to disambiguate these accesses. This paper presents an automated solution based on static construction of access summaries, in which the reference non-linearity problem can be solved for a large number of reference patterns by extracting arbitrarily-shaped predicates that can (in)validate the reference monotonicity property and thus (dis)prove loop independence. Experiments on six benchmarks show that our general technique for dynamic validation of the monotonicity property can cover a large class of codes, incurs minimal run-time overhead and obtains good speedups. © 2013 Springer-Verlag.en
dc.description.sponsorshipThis research was supported in part by NSF awards CRI-0551685, CCF-0833199, CCF-0830753, IIS-096053, IIS-0917266, NSF/DNDOaward 2008-DN-077-ARI018-02,by the DOE NNSA under the Predictive ScienceAcademic Alliances Program by grant DE-FC52-08NA28616, by by Chevron,IBM, Intel, Oracle/Sun and by Award KUS-C1-016-04, made by King AbdullahUniversity of Science and Technology (KAUST).en
dc.publisherSpringer Science + Business Mediaen
dc.subjectaccess summaryen
dc.subjectautoparallelizationen
dc.subjectmonotonicityen
dc.titleA Hybrid Approach to Proving Memory Reference Monotonicityen
dc.typeBook Chapteren
dc.identifier.journalLanguages and Compilers for Parallel Computingen
dc.contributor.institutionTexas A and M University, College Station, United Statesen
kaust.grant.numberKUS-C1-016-04en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.