Relaxing Consistency in Recoverable Distributed Shared Memory (1993)
| Venue: | In Proceedings of the Twenty-Third Annual International Symposium on Fault-Tolerant Computing: Digest of Papers |
| Citations: | 37 - 3 self |
BibTeX
@INPROCEEDINGS{Janssens93relaxingconsistency,
author = {Bob Janssens and W. Kent Fuchs},
title = {Relaxing Consistency in Recoverable Distributed Shared Memory},
booktitle = {In Proceedings of the Twenty-Third Annual International Symposium on Fault-Tolerant Computing: Digest of Papers},
year = {1993},
pages = {155--163}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Relaxed memory consistency models tolerate increased memory access latency in both hardware and software distributed shared memory systems. In recoverable systems, relaxing consistency has the added benefit of reducing the number of checkpoints needed to avoid rollback propagation. In this paper, we introduce new checkpointing algorithms that take advantage of relaxed consistency to reduce the performance overhead of checkpointing. We also introduce a scheme based on lazy relaxed consistency, that reduces both checkpointing overhead and the overhead of avoiding error propagation in systems with error latency. We use multiprocessor address traces to evaluate the relaxed consistency approach to checkpointing with distributed shared memory. 1 Introduction Several parallel architectures use distributed shared memory to avoid the programming complexities of message passing. A distinguishing feature of these architectures is the distribution of memory across many processing nodes connected ...
