✦ LIBER ✦

Asynchronous adaptive optimisation for generic data-parallel array programming

✍ Scribed by Clemens Grelck; Tim van Deurzen; Stephan Herhut; Sven-Bodo Scholz

Publisher: John Wiley and Sons
Year: 2011
Tongue: English
Weight: 846 KB
Volume: 24
Category: Article
ISSN: 1532-0626
DOI: 10.1002/cpe.1842

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

Asynchronous cellular logic network as a

Asynchronous cellular logic network as a co-processor for a general-purpose massively parallel array

✍ Alexey Lopich; Piotr Dudek 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 294 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