𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient communication sets generation for block–cyclic distribution on distributed-memory machines

✍ Scribed by Tsung-Chuan Huang; Liang-Cheng Shiu


Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
316 KB
Volume
48
Category
Article
ISSN
1383-7621

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Efficient Index Set Generation for Compi
✍ 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

Compiling Array Expressions for Efficien
✍ 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

Compilation and Communication Strategies
✍ Rajesh Bordawekar; Alok Choudhary; J. Ramanujam 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 518 KB

program. The need for high performance I/O is so significant that almost all the present generation parallel computers such as the Paragon, SP-2, and nCUBE2. provide some kind of hardware and software support for parallel I/O [dRC94]. Data parallel languages such as High Performance Fortran (HPF) [