• Publications
  • Influence
RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks
This paper presents an algorithm that emulates atomic read/write shared objects in a dynamic network setting. To ensure availability and faulttolerance, the objects are replicated. To ensureExpand
  • 139
  • 16
  • PDF
Fault-Tolerant Parallel Computation
List of Figures. List of Tables. List of Examples and Remarks. List of Symbols. Foreword Franco P. Preparata. 1. Introduction. 2. Models for Robust Computation. 3. The Write-All Problem: Algorithms.Expand
  • 114
  • 14
Efficient parallel algorithms can be made robust
SummaryThe efficient parallel algorithms proposed for many fundamental problems, such as list ranking, integer sorting and computing preorder numberings on trees, are very sensitive to processorExpand
  • 116
  • 14
Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts
The paper presents a robust emulation of multi-writer/multireader registers in message-passing systems using dynamic quorum configurations. In addition to processor and link failures, this emulationExpand
  • 129
  • 14
  • PDF
Eventually-serializable data services
We present a new specification for distributed data services that trade-off immediate consistency guarantees for improved system availability and efficiency, while ensuring the long-term consistencyExpand
  • 92
  • 8
  • PDF
Rambo II: rapidly reconfigurable atomic memory for dynamic networks
This paper presents a new algorithm implementing reconfigurable atomic read/write memory for highly dynamic environments. The original RAMBO algorithm, recently developed by Lynch and Shvartsman [15,Expand
  • 98
  • 7
  • PDF
Rambo: a robust, reconfigurable atomic memory service for dynamic networks
In this paper, we present Rambo, an algorithm for emulating a read/write distributed shared memory in a dynamic, rapidly changing environment. Rambo provides a highly reliable, highly availableExpand
  • 81
  • 7
  • PDF
Writing-all deterministically and optimally using a nontrivial number of asynchronous processors
The problem of performing n tasks on p asynchronous or undependable processors is a basic problem in distributed computing. This article considers an abstraction of this problem called Write-All:Expand
  • 15
  • 6
Specifying and using a partitionable group communication service
  • 119
  • 5
Parallel Algorithms with Processor Failures and Delays
We study efficient deterministic parallel algorithms on two models: restartable fail-stop CRCW PRAMs and asynchronous PRAMs. In the first model, synchronous processes are subject to arbitrary stopExpand
  • 73
  • 5
  • PDF