Randomized registers and iterative algorithms

DOI10.1007/s00446-004-0106-3zbMath1264.68029OpenAlexW2076445104MaRDI QIDQ1953240

Hyunyoung Lee, Jennifer Lundelius Welch

Publication date: 7 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-004-0106-3

zbMATH Keywords

randomizationiterative algorithmsdistributed shared memoryregistersprobabilistic quorums

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items

Computing $k$-Atomicity in Polynomial Time

Cites Work

• On interprocess communication. I: Basic formalism
• On interprocess communication. II: Algorithms
• Yet another application of a binomial recurrence. Order statistics
• Simulating shared memory in real time: On the computation power of reconfigurable architectures
• Combining funnels: A dynamic approach to software combining
• The availability of quorum systems
• Chaotic relaxation
• Fault-tolerant wait-free shared objects
• Distributed asynchronous computation of fixed points
• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• A Correctness Condition for High-Performance Multiprocessors
• Computing with faulty shared objects
• Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies
• The Load, Capacity, and Availability of Quorum Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item