We describe a new approach to programming distributed-memory computers. Rather than having each node in the system explicitly programmed, we derive an efficient message-passing program from a sequential shared-memory program annotated with directions on how elements of shared arrays are distributed
โฆ LIBER โฆ
Reliable butterfly distributed-memory multiprocessors
โ Scribed by Nian-Feng Tzeng
- Book ID
- 119772244
- Publisher
- IEEE
- Year
- 1994
- Tongue
- English
- Weight
- 1011 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0018-9340
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Compiling programs for distributed-memor
โ
David Callahan; Ken Kennedy
๐
Article
๐
1988
๐
Springer US
๐
English
โ 962 KB
Paging tradeoffs in distributed-shared-m
โ
Douglas C. Burger; Rahmat S. Hyder; Barton P. Miller; David A. Wood
๐
Article
๐
1996
๐
Springer US
๐
English
โ 910 KB
Massively parallel processors have begun using commodity operating systems that support demandpaged virtual memory. To evaluate the utility of virtual memory, we measured the behavior of seven shared-memory parallel application programs on a simulated distributed-shared-memory machine. Our results (
Randomized parallel list ranking for dis
โ
Frank Dehne; Siang W. Song
๐
Article
๐
1997
๐
Springer
๐
English
โ 707 KB
A fast poisson solver for distributed me
โ
Serafino, D. Di ;Murli, A. ;Perla, F.
๐
Article
๐
1992
๐
John Wiley and Sons
๐
English
โ 526 KB
Producer-consumer communication in distr
โ
Byrd, G.T.; Flynn, M.J.
๐
Article
๐
1999
๐
IEEE
๐
English
โ 240 KB
Multiprogramming a distributed-memory mu
โ
Leuze, Michael R. ;Dowdy, Lawrence W. ;Park, Kee Hyun
๐
Article
๐
1989
๐
John Wiley and Sons
๐
English
โ 677 KB