2026-09-18T23:01:24Zhttps://repository.rice.edu/server/oai/request

oai:repository.rice.edu:1911/618322024-01-11T20:59:18Zcom_1911_8299col_1911_13110

Kennedy, Ken Sarkar, Vivek Budimlic, Zoran Joyner, Mackale 2011-07-25T01:38:31Z 2011-07-25T01:38:31Z 2009 Joyner, Mackale. "Array optimizations for high productivity programming languages." (2009) Diss., Rice University. <a href="https://hdl.handle.net/1911/61832">https://hdl.handle.net/1911/61832</a>. https://hdl.handle.net/1911/61832 THESIS COMP. SCI. 2009 JOYNER While the HPCS languages (Chapel, Fortress and X10) have introduced improvements in programmer productivity, several challenges still remain in delivering high performance. In the absence of optimization, the high-level language constructs that improve productivity can result in order-of-magnitude runtime performance degradations. This dissertation addresses the problem of efficient code generation for high-level array accesses in the X10 language. The X10 language supports rank-independent specification of loop and array computations using regions and points. Three aspects of high-level array accesses in X10 are important for productivity but also pose significant performance challenges: high-level accesses are performed through Point objects rather than integer indices, variables containing references to arrays are rank-independent, and array subscripts are verified as legal array indices during runtime program execution. Our solution to the first challenge is to introduce new analyses and transformations that enable automatic inlining and scalar replacement of Point objects. Our solution to the second challenge is a hybrid approach. We use an interprocedural rank analysis algorithm to automatically infer ranks of arrays in X10. We use rank analysis information to enable storage transformations on arrays. If rank-independent array references still remain after compiler analysis, the programmer can use X10's dependent type system to safely annotate array variable declarations with additional information for the rank and region of the variable, and to enable the compiler to generate efficient code in cases where the dependent type information is available. Our solution to the third challenge is to use a new interprocedural array bounds analysis approach using regions to automatically determine when runtime bounds checks are not needed. Our performance results show that our optimizations deliver performance that rivals the performance of hand-tuned code with explicit rank-specific loops and lower-level array accesses, and is up to two orders of magnitude faster than unoptimized, high-level X10 programs. These optimizations also result in scalability improvements of X10 programs as we increase the number of CPUs. While we perform the optimizations primarily in X10, these techniques are applicable to other high-productivity languages such as Chapel and Fortress. application/pdf eng Copyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder. Computer science Applied sciences Array optimizations for high productivity programming languages Thesis Text Computer Science Engineering Rice University Doctoral Doctor of Philosophy open.access