Programming for parallelism and locality with hierarchically tiled arrays
Ganesh Bikshandi, Jia Guo, Daniel E. Hoeflinger et al. · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · 2006
Tiling has proven to be an effective mechanism to develop high performance implementations of algorithms. Tiling can be used to organize computations so that communication costs in parallel programs are reduced and locality in sequential codes or sequential components of parallel programs is enhanced.In this paper, a data type - Hierarchically Tiled Arrays or HTAs - that facilitates the direct manipulation of tiles is introduced. HTA operations are overloaded array operations. We argue that the implementation of HTAs in sequential OO languages transforms these languages into powerful tools for the development of high-performance parallel codes and codes with high degree of locality. To support this claim, we discuss our experiences with the implementation of HTAs for MATLAB and C++ and the rewriting of the NAS benchmarks and a few other programs into HTA-based parallel form.
Cited by 128 works. doi:10.1145/1122971.1122981
Authors
- Ganesh Bikshandi
- Jia Guo
- Daniel E. Hoeflinger
- Gheorghe Almási
- Basilio B. Fraguela
- María Jesús Garzarán
- David Padua
- Christoph von Praun
References
- Using MPI: Portable parallel programming with the message-passing interface
- The ILLIAC IV Computer
- PVM-Parallel Virtual Machine: AUsers' Guide and Tutorial for Networked Parallel Computing
- The design and implementation of a first-generation CELL processor
- A data locality optimizing algorithm
- Automated empirical optimizations of software and the ATLAS project
- X10
- Co-array Fortran for parallel programming
- Titanium: a high-performance Java dialect
- Compiling Fortran D for MIMD distributed-memory machines