✦ LIBER ✦

Compiler Support for Array Distribution on NUMA Shared Memory Multiprocessors

✍ Scribed by Tarek S. Abdelrahman; Thomas N. Wong

Book ID: 110257740
Publisher: Springer US
Year: 1998
Tongue: English
Weight: 262 KB
Volume: 12
Category: Article
ISSN: 0920-8542
DOI: 10.1023/a:1008035807599

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Run-time support For parallel functional

Run-time support For parallel functional programming on shared-memory multiprocessors

✍ Lee Ching-Cheng; H.A. Fatmi 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 813 KB

A Compiler-Directed Approach to Network

A Compiler-Directed Approach to Network Latency Reduction for Distributed Shared Memory Multiprocessors

✍ Sibabrata Ray; Hong Jiang; Qing Yang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 254 KB

and/or devising improved routing disciplines in the case of distributed memory architecture, to reduce the expected access time for a variable. Extensive work has been done on both cache design and message routing. In this paper a new shared-data approach is taken to attack the problem. We consider

Compiling Array Expressions for Efficien

Compiling Array Expressions for Efficient Execution on Distributed-Memory Machines

✍ S.K.S. Gupta; S.D. Kaushik; C.-H. Huang; P. Sadayappan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 502 KB

data-parallelism in these languages. Array expressions involve array sections which consist of array elements from a lower index to an upper index at a fixed stride. In order to generate high-performance target code, compilers for distributed-memory machines should produce efficient code for array s

Design issues for a high-performance dis

Design issues for a high-performance distributed shared memory on symmetrical multiprocessor clusters

✍ Sumit Roy; Vipin Chaudhary 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 212 KB

Compiler Algorithms for Optimizing Local

Compiler Algorithms for Optimizing Locality and Parallelism on Shared and Distributed-Memory Machines

✍ M. Kandemir; J. Ramanujam; A. Choudhary 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 608 KB

Distributed-memory message-passing machines deliver scalable performance but are difficult to program. Shared-memory machines, on the other hand, are easier to program but obtaining scalable performance with large number of processors is difficult. Recently, scalable machines based on logically shar

Efficient Index Set Generation for Compi

Efficient Index Set Generation for Compiling HPF Array Statements on Distributed-Memory Machines

✍ S.D. Kaushik; C.-H. Huang; P. Sadayappan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 316 KB

programming environment which allows annotation of single address space programs with distribution directives specifying the mapping of arrays to processors of a distributed-memory machine. The compiler is responsible for partitioning the arrays and generating SPMD messagepassing node code for the a