✦ LIBER ✦

Optimization of array redistribution for distributed memory multicomputers

✍ Scribed by Akiyoshi Wakatani; Michael Wolfe

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 361 KB
Volume: 21
Category: Article
ISSN: 0167-8191
DOI: 10.1016/0167-8191(95)00027-l

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimizations for Efficient Array Redist

Optimizations for Efficient Array Redistribution on Distributed Memory Multicomputers

✍ Shankar Ramaswamy; Barbara Simons; Prithviraj Banerjee 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 333 KB

Dynamic Data Partitioning for Distribute

Dynamic Data Partitioning for Distributed-Memory Multicomputers

✍ Daniel J. Palermo; Eugene W. Hodges IV; Prithviraj Banerjee 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 782 KB

Performance of Adaptive Space Sharing Pr

Performance of Adaptive Space Sharing Processor Allocation Policies for Distributed-Memory Multicomputers

✍ Sivarama P. Dandamudi; Hai Yu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 266 KB

Several space sharing policies have been proposed for distributed-memory multicomputer systems. We consider adaptive space sharing policies, as these policies provide a better performance than fixed and static policies by taking system load and user requirements into account. In this paper we propos

Performance analysis of explicit group p

Performance analysis of explicit group parallel algorithms for distributed memory multicomputer

✍ Kok Fu Ng; Norhashidah Hj. Mohd Ali 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 663 KB

Since their introduction, the four-point explicit group (EG) and explicit decoupled group (EDG) methods in solving elliptic PDE's have been implemented on various parallel computing architectures such as shared memory parallel computer and distributed computer systems. However, no detailed study on

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

Array Operation Synthesis to Optimize HP

Array Operation Synthesis to Optimize HPF Programs on Distributed Memory Machines

✍ Gwan-Hwan Hwang; Jenq Kuen Lee; Roy Dz-Ching Ju 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 435 KB

An increasing number of programming languages, such as Fortran 90, HPF, and APL, provide a rich set of intrinsic array functions and array expressions. These constructs, which constitute an important part of data parallel languages, provide excellent opportunities for compiler optimizations. The syn