Software transactional distributed shared memory

Authors:
Alokika Dash;Brian Demsky
Affiliations:
University of California, Irvine, USA;University of California, Irvine, USA
Venue:
Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming
Year:
2009

Citing 3
Cited 2

A high-performance, portable implementation of the MPI message passing interface standard

Parallel Computing
Transaction Processing: Concepts and Techniques

Transaction Processing: Concepts and Techniques
TreadMarks: distributed shared memory on standard workstations and operating systems

WTEC'94 Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference

Data race avoidance and replay scheme for developing and debugging parallel programs on distributed shared memory systems

Parallel Computing
SPECTRE: speculation to hide communication latency

Proceedings of the Second Asia-Pacific Workshop on Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We have developed a transaction-based approach to distributed shared memory(DSM) that supports object caching and generates 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 approach that can prefetch objects whose addresses have not been computed or predicted. Our DSM uses both prefetching and caching of remote objects to hide network latency while relying on the two-phase transaction commit mechanism to preserve the simple transactional consistency model that we present to the developer. We have evaluated this approach on a matrix multiply benchmark. We have found that our approach enables to effectively utilize multiple machines in a cluster and also benefit from prefetching and caching of objects.