✦ LIBER ✦

Efficient Address Generation for Affine Subscripts in Data-Parallel Programs

✍ Scribed by Kuei-Ping Shih; Jang-Ping Sheu; Chih-Yung Chang

Book ID: 110259876
Publisher: Springer US
Year: 2000
Tongue: English
Weight: 324 KB
Volume: 17
Category: Article
ISSN: 0920-8542
DOI: 10.1023/a:1008190606079

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generating Local Addresses and Communica

Generating Local Addresses and Communication Sets for Data-Parallel Programs

✍ 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 Index Generation for Compiling

Efficient Index Generation for Compiling Two-Level Mappings in Data-Parallel Programs

✍ 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

Efficient local memory sequence generati

Efficient local memory sequence generation for data parallel programs using permutations

✍ Tsung-Chuan Huang; Liang-Cheng Shiu; Jui-Hsiang Huang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 297 KB

Efficient Computation of Address Sequenc

Efficient Computation of Address Sequences in Data Parallel Programs Using Closed Forms for Basis Vectors

✍ 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

An efficient algorithm for communication

An efficient algorithm for communication set generation of data parallel programs with block-cyclic distribution

✍ Gwan-Hwan Hwang 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 458 KB