KAUST Grant NumberKUS-C1-016-04
Permanent link to this recordhttp://hdl.handle.net/10754/597290
MetadataShow full item record
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.
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.
SponsorsThis 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).
PublisherSpringer Science + Business Media