๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Efficient Index Generation for Compiling
โœ Kuei-Ping Shih; Jang-Ping Sheu; Chua-Huang Huang; Chih-Yung Chang ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 710 KB

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

Generating Local Addresses and Communica
โœ S. Chatterjee; J.R. Gilbert; F.J.E. Long; R. Schreiber; S.H. Teng ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 988 KB

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

Efficient Computation of Address Sequenc
โœ Ashwath Thirumalai; J. Ramanujam ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 429 KB

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