This document describes a set of new techniques for improving the efficiency of compiler-directed software prefetching for parallel Fortran programs running on cache-coherent DSM (distributed shared memory) multiprocessors. The key component used in this scheme is a data flow framework

of an incorrectly prefetched page to be equivalent to that of a miss, these techniques have an effective page miss rate of 63 % and 71 % respectively. Additionally, these two techniques are compared with two well-known software distributed shared memory (sDSM) prefetch techniques, Adaptive++ and TODFCM. TRe

present our prototype implementation of JaMP in the research compiler Jackal, a software-based distributed shared memory implementation for Java. We evaluate the performance of JaMP with a set of micro-benchmarks and with OpenMP versions of the parallel Java Grande Forum (JGF) benchmarks. The micro

A key obstacle to achieving high performance on software distributed shared memory (DSM) systems is their high memory latencies. Software-controlled prefetching tolerates memory latency by overlapping computation with communication. This thesis proposes and evaluates an implementation of software

Abstract. Dynamic optimizers modify the binary code of programs at runtime by profiling and optimizing certain aspects of the execution. We present a completely software-based framework that dynamically optimizes programs for object-based Distributed Shared Memory (DSM) systems. In DSM systems

We investigate the use of a software distributed shared memory (DSM) layer to support irregular computations on distributed memory machines. Software DSM supports irregular computation through demand fetching of data in response to memory access faults. With the addition of a very limited form

in isolation, this paper is the first to evaluate both techniques using a consistent hardware platform and set of applications, thereby allowing direct comparisons. In addition, this is the first study to consider combining prefetching and multithreading in a software DSM. We performed our experiments on real

We have developed a transaction-based approach to distributed shared memory(DSM) that supports object caching and gener-ates path expression prefetches. A path expression specifies a path through the heap that traverses the objects to be prefetched. To our knowledge, this is the first prefetching

collectors, which also deal with replicated objects and partitioned arrays. The paper discusses the various distributed memory management techniques used in the system and presents performance results on a cluster of workstations. Keywords: Java, fine-grained software DSM, parallel garbage collection. 1