𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient address generation in a parallel processor

✍ Scribed by De-Lei Lee

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
498 KB
Volume
36
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A New Efficient Algorithm for Computatio
A New Efficient Algorithm for Computational Aeroacoustics on Parallel Processors
✍ Yusuf Γ–zyΓΆrΓΌk; Lyle N. Long πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 922 KB

conditions. These conditions, which represent additional time-dependent partial differential equations, are ex-One of the great challenges in computational physics is the prediction of flow associated noise, where the quantities of interest, tremely important for successful aeroacoustic simulations.

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

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