𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Managing distributed shared arrays in a bulk-synchronous parallel programming environment

✍ Scribed by Christoph W. Kessler


Publisher
John Wiley and Sons
Year
2004
Tongue
English
Weight
280 KB
Volume
16
Category
Article
ISSN
1532-0626

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

NestStep is a parallel programming language for the BSP (bulk‐hronous parallel) programming model. In this article we describe the concept of distributed shared arrays in NestStep and its implementation on top of MPI. In particular, we present a novel method for runtime scheduling of irregular, direct remote accesses to sections of distributed shared arrays. Our method, which is fully parallelized, uses conventional two‐sided message passing and thus avoids the overhead of a standard implementation of direct remote memory access based on one‐sided communication. The main prerequisite is that the given program is structured in a BSP‐compliant way. Copyright © 2004 John Wiley & Sons, Ltd.


📜 SIMILAR VOLUMES


Determining the Execution Time Distribut
✍ Yan Alexander Li; John K. Antonio; Howard Jay Siegel; Min Tan; Daniel W. Watson 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 278 KB

An important problem in heterogeneous computing (HC) is predicting task execution time. A methodology is introduced for determining the execution time distribution for a given data parallel program that is to be executed in an SIMD, MIMD (SPMD), and/or mixed-mode SIMD/MIMD (SPMD) HC environment. The