Constructing multi-reader atomic values from non-atomic values
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallel asynchronous algorithms for discrete data
Journal of the ACM (JACM)
A correctness condition for high-performance multiprocessors (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Randomized algorithms
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
The availability of quorum systems
Information and Computation
Computing with faulty shared objects
Journal of the ACM (JACM)
Effects of asynchronism on the convergence rate of iterative algorithms
Journal of Parallel and Distributed Computing
ACM Transactions on Computer Systems (TOCS)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
SIAM Journal on Computing
Combining funnels: a new twist on an old tale…
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Fault-tolerant wait-free shared objects
Journal of the ACM (JACM)
Simulating shared memory in real time: on the computation power of reconfigurable architectures
Information and Computation
Weak ordering—a new definition
ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data
Proceedings of the Sixth International Conference on Data Engineering
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
IEEE Transactions on Computers
The load, capacity and availability of quorum systems
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Randomized Shared Queues Applied to Distributed Optimization Algorithms
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Dijkstra's Self-Stabilizing Algorithm in Unsupportive Environments
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
A Quorum-Based Protocol for Searching Objects in Peer-to-Peer Networks
IEEE Transactions on Parallel and Distributed Systems
Probabilistic quorums for dynamic systems
Distributed Computing - Special issue: DISC 03
On specification of Read/Write shared variables
Journal of the ACM (JACM)
Write Markers for Probabilistic Quorum Systems
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
| Hi-index | 0.00 |
Abstract: This paper presents a definition of a read-write register that sometimes returns out-of-date values, shows that the definition is implemented by the probabilistic quorum algorithm of [19], and shows how to program with such registers using the framework of Uresin and Dubois [25]. Consequently, existing iterative algorithms for an interesting class of problems (including finding shortest paths, constraint satisfaction, and transitive closure) will converge with high probability if executed in a system in which the shared data is implemented with registers satisfying the new definition. Furthermore, the algorithms in this framework will inherit positive attributes concerning load and availability from the underlying register implementation. A monotone version of the new register definition is specified and implemented; it can provide improved expected convergence time and message complexity for iterative algorithms.