✦ LIBER ✦

A compiler for exploiting nested parallelism in OpenMP programs

✍ Scribed by Xinmin Tian; Jay P. Hoeflinger; Grant Haab; Yen-Kuang Chen; Milind Girkar; Sanjiv Shah

Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 277 KB
Volume: 31
Category: Article
ISSN: 0167-8191
DOI: 10.1016/j.parco.2005.03.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A compiling approach for exploiting AND-

A compiling approach for exploiting AND-parallelism in logic programs

✍ Hwang Zhiyi; Hu Shouren 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 447 KB

An OpenMP-like interface for parallel pr

An OpenMP-like interface for parallel programming in Java

✍ M. E. Kambites; J. Obdržálek; J. M. Bull 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 180 KB

Spar: A programming language for semi-au

Spar: A programming language for semi-automatic compilation of parallel programs

✍ van Reeuwijk, Kees; van Gemund, Arjan J. C.; Sips, Henk J. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 86 KB 👁 2 views

We present Spar, a programming language for semi-automatic parallel programming, in particular for the programming of array-based applications. The language has been designed as part of the Automap project, in which a compiler and runtime system are being developed for distributed-memory systems. As

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

A Methodology for Granularity-Based Cont

A Methodology for Granularity-Based Control of Parallelism in Logic Programs

✍ P. LOPEZ; M. HERMENEGILDO; S. DEBRAY 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 674 KB

Several types of parallelism can be exploited in logic programs while preserving correctness and efficiency, i.e. ensuring that the parallel execution obtains the same results as the sequential one and the amount of work performed is not greater. However, such results do not take into account a numb

A Methodology for Exploiting Concurrency

A Methodology for Exploiting Concurrency among Independent Tasks in Partitionable Parallel Processing Systems

✍ W.G. Nation; A.A. Maciejewski; H.J. Siegel 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 709 KB

One benefit of partitionable parallel processing systems is their ability to execute multiple, independent tasks simultaneously. Previous work has identified conditions such that, when there are \(k\) tasks to be processed, partitioning the system so that all \(k\) tasks are processed simultaneously