Data optimization: minimizing residual interprocessor data motion on SIMD machines
暂无分享,去创建一个
Basic concepts in array layout are summarized, and unhonored preferences and residual data motion are discussed. A technique for minimizing such motion is presented. For each array the source program is divided into regions, each associated with a single home. This enables efficient handling of residual data motion. The partitioning into regions is based on control flow and data dependence. Preliminary results obtained with this technique show an order-of-magnitude improvement for certain classes of programs.<<ETX>>
[1] David A. Padua,et al. Dependence graphs and compiler optimizations , 1981, POPL '81.
[2] Guy L. Steele,et al. Data Optimization: Allocation of Arrays to Reduce Communication on SIMD Machines , 1990, J. Parallel Distributed Comput..
[3] Micha Sharir,et al. Structural Analysis: A New Approach to Flow Analysis in Optimizing Compilers , 2015 .
[4] Allan L. Fisher,et al. Communication and code optimization in SIMD programs , 1988, ICPP.