Graceful quorum reconfiguration in a robust emulation of shared memory

No abstract is available for this paper.

• Publication year

  2000

• Venue

  Proceedings 20th IEEE International Conference on Distributed Computing Systems

• Publication date

  2000-04-10

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/ICDCS.2000.840958
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Efficient and Robust Sharing of Memory in Message-Passing Systems

  2000cited by this paper
• A Dynamic Primary Configuration Group Communication Service

  1999cited by this paper
• Fault detection for Byzantine quorum systems

  1999cited by this paper
• A dynamic view-oriented group communication service

  1998cited by this paper
• A fault-tolerant algorithm for decentralized on-line quorum adaptation

  1998cited by this paper
• Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts

  1997influential reference
• Byzantine quorum systems

  1997cited by this paper
• Dynamic voting for consistent primary components

  1997cited by this paper
• The Synchronization Cost of On-line Quorum Adaptation

  1997cited by this paper
• Efficient and Robust Sharing of Memory in Message-Passing Systems (Extended Abstract)

  1996cited by this paper
• Evaluating quorum systems over the Internet

  1996cited by this paper
• The Availability of Quorum Systems

  1995cited by this paper
• Management: what and why

  1994cited by this paper
• On mutual exclusion in faulty distributed systems

  1994cited by this paper
• Dealing with history and time in a distributed enterprise manager

  1993cited by this paper
• Distributed Algorithms

  1992cited by this paper
• Resilient Logical Structures for Efficient Management of Replicated Data

  1992cited by this paper
• Dynamic management of highly replicated data

  1992cited by this paper
• A Robust Distributed Mutual Exclusion Algorithm

  1991cited by this paper
• Dynamic voting algorithms for maintaining the consistency of a replicated database

  1990cited by this paper
• Linearizability: a correctness condition for concurrent objects

  1990cited by this paper
• Sharing memory robustly in message-passing systems

  1990cited by this paper
• An Introduction to Input/Output Automata

  1989cited by this paper
• Dynamic quorum adjustment for partitioned data

  1987cited by this paper
• The information structure of distributed mutual exclusion algorithms

  1987cited by this paper
• Maintaining availability in partitioned replicated databases

  1987cited by this paper
• Consistency in a partitioned network: a survey

  1985cited by this paper
• How to assign votes in a distributed system

  1985cited by this paper
• An efficient, fault-tolerant protocol for replicated data management

  1985cited by this paper
• REPLICATION METHODS FOR ABSTRACT DATA TYPES

  1984cited by this paper
• Weighted voting for replicated data

  1979cited by this paper

• Electronic Crime Investigation

  2022cites this paper
• Communication Mechanism in a Distributed System

  2022cites this paper
• Space Complexity of Fault-Tolerant Register Emulations

  2017cites this paper
• Space Bounds for Reliable Multi-Writer Data Store: Inherent Cost of Read/Write Primitives

  2015cites this paper
• SmartMerge: A New Approach to Reconfiguration for Atomic Storage

  2015cites this paper
• Brief Announcement: Consistency and Complexity Tradeoffs for Highly-Available Multi-cloud Store

  2013cites this paper
• Specification and Analytical Evaluation of Heterogeneous Dynamic Quorum-Based Data Replication Schemes

  2012cites this paper
• Ramos: Concurrent writing and reconfiguration for collaborative systems

  2012cites this paper
• Quorum Systems: With Applications to Storage and Consensus

  2012cites this paper
• On the Practicality of Atomic MWMR Register Implementations

  2011influential citation
• Algorithm CwFr : Using Quorum Views for Fast Reads in the MWMR Setting ∗

  2011cites this paper
• Dynamic atomic storage without consensus

  2011cites this paper
• Émulation de mémoire partagée en environnements distribués dynamiques

  2011cites this paper
• Robust data sharing with key-value stores

  2011cites this paper
• Towards Feasible Implementations of Low-Latency Multi-writer Atomic Registers

  2011cites this paper
• Trade-offs in implementing consistent distributed storage

  2011cites this paper
• Fast Access to Distributed Atomic Memory

  2010cites this paper
• Robust Simulation of Shared Memory: 20 Years After

  2010cites this paper
• Developing a Consistent Domain-Oriented Distributed Object Service

  2009cites this paper
• On the Efficiency of Atomic Multi-reader, Multi-writer Distributed Memory

  2009cites this paper
• Dynamic atomic storage without consensus

  2009cites this paper
• Evaluating a Dependable Sharable Atomic Data Service on a Planetary-Scale Network

  2009cites this paper
• On the robustness of (semi) fast quorum-based implementations of atomic shared memory

  2008cites this paper
• Implementing Shared Registers in Asynchronous Message-Passing Systems

  2008cites this paper
• Implementing Shared Registers in Asynchronous Message-Passing Systems, 1995; Attiya, Bar-Noy, Dolev

  2008cites this paper
• Distributed Shared Memory for Large-Scale Dynamic Systems. (Mémoire partagée distribuée pour systèmes dynamiques à grande échelle)

  2007cites this paper
• Implementing Atomic Memory in Dynamic Networks , Using an Aggressive Reconfiguration Strategy

  2007cites this paper
• GeoQuorums : Implementing Atomi Memoryin Mobile Ad Ho Networks ( Extended Abstra t )

  2007cites this paper
• Distributed Shared Memory for Large-Scale Dynamic Systems

  2007cites this paper
• Lower bounds for asynchronous consensus

  2006cites this paper
• Is it possible to ensure strong data guarantees in highly mobile networks ?

  2006cites this paper
• Fault-tolerant semifast implementations of atomic read/write registers

  2006cites this paper
• Self-Adjusting Atomic Memory for Dynamic Systems based on Quorums On-The-Fly. Correctness Study

  2006cites this paper
• Mémoire atomique auto-reconfigurable pour systèmes P 2 P

  2005cites this paper
• SAM: Self* Atomic Memory for P2P Systems

  2005cites this paper
• Etna: A Fault-tolerant Algorithm for Atomic Mutable DHT Data

  2005cites this paper
• Reconfigurable distributed storage for dynamic networks

  2005cites this paper
• Operation Liveness and Gossip Management in a Dynamic Distributed Atomic Data Service

  2005cites this paper
• Robust services in dynamic systems

  2005cites this paper
• P2P architecture for self-atomic memory

  2005cites this paper
• Developing a Consistent Domain-Oriented Distributed Object Service

  2005cites this paper
• Implementing a reconfigurable atomic memory service for dynamic networks

  2004cites this paper
• A pleasant stroll through the land of infinitely many creatures

  2004cites this paper
• Long-lived Rambo: Trading knowledge for communication

  2004cites this paper
• ACM SIGACT News Distributed Computing Column 14

  2004cites this paper
• Metropolitan Ad Hoc Network

  2003cites this paper
• Overcoming the Majority Barrier in Large-Scale Systems

  2003cites this paper
• RamboNodes for the Metropolitan Ad Hoc Network

  2003cites this paper
• ACM SIGACT news distributed computing column 13

  2003cites this paper
• Communication and Data Sharing for Dynamic Distributed Systems

  2003cites this paper
• A Correctness Proof for a Byzantine-Fault-Tolerant Read/Write Atomic Memory with Dynamic Replica Membership

  2003cites this paper
• Rambo II: rapidly reconfigurable atomic memory for dynamic networks

  2003cites this paper
• GeoQuorums: implementing atomic memory in mobile ad hoc networks

  2003cites this paper
• GeoQuorums : Implementing Atomic Memory in Ad Hoc Networks ( Extended Abstract )

  2003cites this paper
• RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks

  2002cites this paper
• A Dynamic Primary Configuration Group Communication Service

  1999cites this paper