Availability Study of Dynamic Voting Algorithms
Fault tolerant distributed systems often select a primary component to allow a subset of the processes to function when failures occur. The dynamic voting paradigm defines rules for selecting the primary component adaptively: when a partition occurs, if a majority of the previous primary component i...
Main Authors: | Ingols, Kyle, Keidar, Idit |
---|---|
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/149301 |
Similar Items
-
Availablity study of dynamic voting algorithms
by: Ingols, Kyle W. (Kyle William), 1977-
Published: (2014) -
A General Framework for Highly Available Services based on Group Communication
by: Fekete, Alan, et al.
Published: (2023) -
A Client-Server Approach to Virtually Synchronous Group Multicast: Specifications, Algorithms, and Proofs
by: Keidar, Idit, et al.
Published: (2023) -
Early-Delivery Dynamic Atomic Broadcast
by: Bar-Joseph, Ziv, et al.
Published: (2023) -
A Client-Server Oriented Algorithm for Virtually Synchronous Group Membership in WANs
by: Keidar, Idit, et al.
Published: (2023)