Randomized shared queues

Authors:
Hyunyoung Lee;Jennifer L. Welch
Affiliations:
Texas A&M Univ., College Station;Texas A&M Univ., College Station
Venue:
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Year:
2001

Citing 3
Cited 1

Parallel and distributed computation: numerical methods

Parallel and distributed computation: numerical methods
Byzantine quorum systems

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Probabilistic quorum systems

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing

Probabilistic quorums for dynamic systems

Distributed Computing - Special issue: DISC 03

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a specification of a randomized shared queue that can lose some elements or return them out of order (not in FIFO), shows that the specification can be implemented over the probabilistic quorum algorithm of [4, 3], and analyzes the behavior of this implementation. Distributed algorithms that can tolerate some lost and out-of-order messages are candidates for replacing the message queues with random queues. The modified algorithms will inherit positive attributes concerning load and availability from the underlying queue implementation. The behavior of an application — a class of combinatorial optimization algorithms — when it is implemented using random queues is analyzed.