Accession Number : ADA266931


Title :   Relaxing Consistency in Recoverable Distributed Shared Memory


Corporate Author : ILLINOIS UNIV AT URBANA COORDINATED SCIENCE LAB


Personal Author(s) : Janssens, Bob ; Fuchs, W K


Full Text : https://apps.dtic.mil/dtic/tr/fulltext/u2/a266931.pdf


Report Date : Jan 1993


Pagination or Media Count : 9


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.


Descriptors :   *DISTRIBUTED DATA PROCESSING , *MEMORY DEVICES , ALGORITHMS , PROPAGATION , COMPUTER ARCHITECTURE , ERRORS , MULTIPROCESSORS , BENEFITS , APPROACH , PAPER , NUMBERS , ACCESS , CONSISTENCY , PARALLEL PROCESSING , MODELS , RECOVERY


Subject Categories : Computer Systems


Distribution Statement : APPROVED FOR PUBLIC RELEASE