A Hybrid Approach to Proving Memory Reference Monotonicity

摘要: Array references indexed by non-linear expressions or subscript arrays represent a major obstacle to compiler analysis and automatic parallelization. Most previous proposed solutions either enhance the static repertoire recognize more patterns, infer array-value properties, refine mathematical support, apply expensive run time of memory reference traces disambiguate these accesses. This paper presents an automated solution based on construction access summaries, in which non-linearity problem can be solved for large number patterns extracting arbitrarily-shaped predicates that (in)validate monotonicity property thus (dis)prove loop independence. Experiments six benchmarks show our general technique dynamic validation cover class codes, incurs minimal run-time overhead obtains good speedups.