HPF on Fine-Grain Distributed Shared Memory: Early Experience

This paper examines the performance of a suite of HPF applications on a network of workstations using two different compilation approaches: generating explicit message-passing code, and generating code for a shared address space provided by a finegrain distributed shared memory system (DSM). Preliminary experiments indicate that the DSM approach performs with usually a small slowdown compared to the message passing approach on regular programs, yet enables efficient execution of non-regular programs


Published in:
9th International Workshop on Languages and Compilers for Parallel Computing, 1239, 450-465
Year:
1997
Publisher:
Springer
Laboratories:




 Record created 2013-12-23, last modified 2018-09-13


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)