Results 1 - 10 of 518

A checkpoint protocol for an entry consistent shared memory system

by Nuno Neves, Miguel Castro, Paulo Guedes - In Proceedings of the 13th ACM Symposium on Principles of Distributed Computing (PODC'94). ACM, ACM , 1994
"... Workstation clusters are becoming an interesting alternative to dedicated multiprocessors. In this environment, the probability of a failure, during an application’s execution, increases with the execution time and the number of workstations used. If no provision is made for handling failures, it is ..."
Abstract - Cited by 61 (10 self) - Add to MetaCart
, it is unlikely that long running applications will terminate successfully. One solution to this problem is process checkpointing. This paper presents a checkpoint protocol for a multithreaded distributed shared memory system based on the entry consistency memory model. The protocol allows transparent recovery

ABSTRACT A Checkpoint Protocol for an Entry Consistent Shared Memory System

by unknown authors
"... Workstation clusters are becoming an interesting alternative to dedicated multiprocessors. In this environment, the probability of a failure, during an application’s execution, increases with the execution time and the number of workstations used. If no provision is made for handling failures, it is ..."
Abstract - Add to MetaCart
, it is unlikely that long running applications will terminate successfully. One solution to this problem is process checkpointing. This paper presents a checkpoint protocol for a multithreaded distributed shared memory system based on the entry consistency memory model. The protocol allows transparent recovery

Evaluation of Release Consistent Software Distributed Shared Memory on Emerging Network Technology

by Sandhya Dwarkadas, Pete Keleher, Alan L. Cox, Willy Zwaenepoel
"... We evaluate the effect of processor speed, network characteristics, and software overhead on the performance of release-consistent software distributed shared memory. We examine five different protocols for implementing release consistency: eager update, eager invalidate, lazy update, lazy invalidat ..."
Abstract - Cited by 467 (43 self) - Add to MetaCart
We evaluate the effect of processor speed, network characteristics, and software overhead on the performance of release-consistent software distributed shared memory. We examine five different protocols for implementing release consistency: eager update, eager invalidate, lazy update, lazy

Implementation and performance of Munin

by John B. Carter, John K. Bennett, Willy Zwaenepoel - IN PROCEEDINGS OF THE 13TH ACM SYMPOSIUM ON OPERATING SYSTEMS PRINCIPLES , 1991
"... Munin is a distributed shared memory (DSM) system that allows shared memory parallel programs to be executed efficiently on distributed memory multiprocessors. Munin is unique among existing DSM systems in its use of multiple consistency protocols and in its use of release consistency. In Munin, sha ..."
Abstract - Cited by 587 (22 self) - Add to MetaCart
Munin is a distributed shared memory (DSM) system that allows shared memory parallel programs to be executed efficiently on distributed memory multiprocessors. Munin is unique among existing DSM systems in its use of multiple consistency protocols and in its use of release consistency. In Munin

Midway: Shared Memory Parallel Programming with Entry Consistency for Distributed Memory Multiprocessors

by Brian N. Bershad , Matthew J. Zekauskas , 1991
"... Distributed memory multiprocessing offers a cost-effective and scalable solution for a large class of scientific and numeric applications. Unfortunately, the performance of current distributed memory programming environments suffers because the frequency of communication between processors can excee ..."
Abstract - Cited by 194 (0 self) - Add to MetaCart
within a single globally shared memory. Local memories on each processor cache recently used data to counter the effects of network latency. Midway is based on a new model of memory consistency called entry consistency. Entry consistency exploits the relationship between synchronization objects

The Performance of Consistent Checkpointing in Distributed Shared Memory Systems

by Gilbert Cabillic, Gilles Muller, Isabelle Puaut - In Proc. of the 14th Symp. on Reliable Distributed Systems , 1995
"... This paper presents the design and implementation of a consistent checkpointing scheme for Distributed Shared Memory (dsm) systems. Our approach relies on the integration of checkpoints within synchronization barriers already existing in applications; this avoids the need to introduce an additional ..."
Abstract - Cited by 32 (3 self) - Add to MetaCart
This paper presents the design and implementation of a consistent checkpointing scheme for Distributed Shared Memory (dsm) systems. Our approach relies on the integration of checkpoints within synchronization barriers already existing in applications; this avoids the need to introduce an additional

Scope Consistency : A Bridge between Release Consistency and Entry Consistency

by Liviu Iftode, Jaswinder Pal Singh, Kai Li - In Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures , 1996
"... The large granularity of communication and coherence in shared virtual memory systems causes problems with false sharing and extra communication. Relaxed memory consistency models have been used to alleviate these problems, but at a cost in programming complexity. Release Consistency (RC) and Lazy R ..."
Abstract - Cited by 170 (12 self) - Add to MetaCart
The large granularity of communication and coherence in shared virtual memory systems causes problems with false sharing and extra communication. Relaxed memory consistency models have been used to alleviate these problems, but at a cost in programming complexity. Release Consistency (RC) and Lazy

Performance Evaluation of Two Home-Based Lazy Release Consistency Protocols for Shared Virtual Memory Systems

by Yuanyuan Zhou, Liviu Iftode, Kai Li - In Proceedings of the Operating Systems Design and Implementation Symposium , 1996
"... This paper investigates the performance of shared virtual memory protocols on large-scale multicomputers. Using experiments on a 64-node Paragon, we show that the traditional Lazy Release Consistency (LRC) protocol does not scale well, because of the large number of messages it requires, the large a ..."
Abstract - Cited by 160 (20 self) - Add to MetaCart
This paper investigates the performance of shared virtual memory protocols on large-scale multicomputers. Using experiments on a 64-node Paragon, we show that the traditional Lazy Release Consistency (LRC) protocol does not scale well, because of the large number of messages it requires, the large

SafetyNet: improving the availability of shared memory multiprocessors with global checkpoint/recovery

by Daniel J. Sorin, Milo M. K. Martin, Mark D. Hill, David A. Wood - In Proceedings of the 29th Annual International Symposium on Computer Architecture , 2002
"... We develop an availability solution, called SafetyNet, that uses a unified, lightweight checkpoint~recovery mechanism to support multiple long-latency fault detection schemes. At an abstract level, SafetyNet logically maintains multi-ple, globally consistent checkpoints of the state of a shared memo ..."
Abstract - Cited by 137 (10 self) - Add to MetaCart
We develop an availability solution, called SafetyNet, that uses a unified, lightweight checkpoint~recovery mechanism to support multiple long-latency fault detection schemes. At an abstract level, SafetyNet logically maintains multi-ple, globally consistent checkpoints of the state of a shared

Checkpointing Speculative Distributed Shared Memory

by Arkadiusz Danilecki, Anna Kobusińska, Michal Szychowiak - IN PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING AND APPLIED MATHEMATICS , 2005
"... Abstract. This paper describes a checkpointing mechanism destined for Distributed Shared Memory (DSM) systems with speculative prefetching. Speculation is a general technique involving prediction of the future of a computation, namely accesses to shared objects unavailable on the accessing node (rea ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Abstract. This paper describes a checkpointing mechanism destined for Distributed Shared Memory (DSM) systems with speculative prefetching. Speculation is a general technique involving prediction of the future of a computation, namely accesses to shared objects unavailable on the accessing node
Results 1 - 10 of 518