Subregion Analysis and Bounds Check Elimination for High Level Arrays

For decades, the design and implementation of arrays in programming languages has reflected a natural tension between productivity and performance. Recently introduced HPCS languages (Chapel, Fortress and X10) advocate the use of high-level arrays for improved productivity. For example, high-level arrays in the X10 language support rank-independent specification of multidimensional loop and array computations using regions and points. Three aspects of X10 high-level arrays are important for productivity but pose significant performance challenges: high-level accesses are performed through point objects rather than integerindices, variablescontainingreferencestoarraysarerank-independent, and all subscripts in a high-level array access must be checked for bounds violations. The first two challenges have been addressed in past work. In this paper, we address the third challenge of optimizing the overhead of array bounds checks by developing a novel region-based interprocedural array b...

• Type: Journal
• Year: 2011
• Where: CC
• Authors: Mackale Joyner, Zoran Budimlic, Vivek Sarkar
• Keywords: Array Bounds, Array Computations, CC 2011, Elimination Algorithm, System Software