✦ LIBER ✦

A general data dependence analysis for parallelizing compilers

✍ Scribed by Jing Zhou; Guosun Zeng

Publisher: Springer US
Year: 2008
Tongue: English
Weight: 117 KB
Volume: 45
Category: Article
ISSN: 0920-8542
DOI: 10.1007/s11227-008-0197-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A general data dependence analysis for p

A general data dependence analysis for parallelizing compilers

✍ Jing Zhou; Guosun Zeng 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 399 KB

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

Parallel loops — A test suite for parall

Parallel loops — A test suite for parallelizing compilers: Description and example results

✍ Jack Dongarra; Mark Furtney; Steve Reinhardt; Jerry Russell 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 505 KB

Several multiprocessor systems are now commercially available, and advances in compiler technology provide automatic conversion of programs to run on such systems. However, no accepted measure of this parallel compiler ability exists. This paper presents a test suite of subroutines and loops, called

Compiling data-parallel programs for clu

Compiling data-parallel programs for clusters of SMPs

✍ Siegfried Benkner; Thomas Brandes 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 233 KB

NUAPC: A parallelizing compiler for C++

✍ Genjiang Zhu; Li Xie; Zhongxiu Sun 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 696 KB

Compile-Time Estimation of Communication

Compile-Time Estimation of Communication Costs for Data Parallel Programs

✍ Thomas Fahringer 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 416 KB

A key measure of the performance of a distributed memory parallel program is the communication overhead. On most current parallel systems, sending data from a local to a remote processor still takes one or two orders of magnitude longer than the time to access data on a local processor. The behavior