This paper presents compilation techniques used to compress holes, which are caused by the nonunit alignment stride in a two-level data-processor mapping. Holes are the memory locations mapped by useless template cells. To fully utilize the memory space, memory holes should be removed. In a two-leve
Efficient local memory sequence generation for data parallel programs using permutations
โ Scribed by Tsung-Chuan Huang; Liang-Cheng Shiu; Jui-Hsiang Huang
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 297 KB
- Volume
- 47
- Category
- Article
- ISSN
- 1383-7621
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Generating local addresses and communication sets is an important issue in distributed-memory implementations of data-parallel languages such as High Performance Fortran. We demonstrate a storage scheme for an array \(A\) affinely aligned to a template that is distributed across \(p\) processors wit
Arrays are mapped to processors through a two-step process-alignment followed by distribution-in data-parallel languages such as High Performance Fortran. This process of mapping creates disjoint pieces of the array that are locally owned by each processor. An HPF compiler that generates code for ar