Randomized Shared Queues Applied to Distributed Optimization Algorithms

Authors:
Hyunyoung Lee;Jennifer L. Welch
Affiliations:
-;-
Venue:
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Year:
2001

Citing 8
Cited 0

Parallel and distributed computation: numerical methods

Parallel and distributed computation: numerical methods
Randomized algorithms

Randomized algorithms
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
Parallel 'Go with the Winners' Algorithms in the LogP Model

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Applications of Probabilistic Quorums to Iterative Algorithms

ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Randomized byzantine generals

SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
"Go with the winners" algorithms

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science

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, and shows that the specification can be implemented with the probabilistic quorum algorithm of [5,6]. Distributed algorithms that incorporate the producer-consumer style of interprocess communication are candidate applications for using random shared queues in lieu of the message queues. The modified algorithms will inherit positive attributes concerning load and availability from the underlying queue implementation. The behavior of a generic combinatorial optimization algorithm, when it is implemented using random queues, is analyzed.