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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aldous, D., Vazirani, U.: “Go With the Winners” Algorithms. Proc. 35th IEEE Symp. on Foundations of Computer Science, pp. 492–501, 1994.
Bertsekas, D., Tsitsiklis, J.: Parallel and Distributed Computation, Prentice-Hall Inc., Englewood Cliffs, NJ, 1989.
Chakrabarti, S., Ranade, A., Yelick, K.: Randomized Load Balancing for Treestructured Computation. Proc. IEEE Scalable High Performance Comp. Conf., pp. 666–673, 1994.
Lee, H., Welch, J. L.: Applications of Probabilistic Quorums to Iterative Algorithms. Proc. 21st IEEE Int. Conf. on Distributed Computing Systems, pp. 21–28, 2001.
Malkhi, D., Reiter, M.: Byzantine Quorum Systems. Proc. 29th ACM Symp. on Theory of Computing, pp. 569–578, 1997.
Malkhi, D., Reiter, M., Wright, R.: Probabilistic Quorum Systems. Proc. 16th ACM Symp. on Principles of Dist. Comp., pp. 267–273, 1997.
Motwani, R., Raghavan, P.: Randomized Algorithms, Cambridge Univ. Press, 1995.
Peinado, M., Lengauer, T.: Parallel ‘Go with the Winners’ Algorithms in the LogP Model. Proc. IPPS 97, 1997.
Rabin, M. O.: Randomized Byzantine Generals. Proc. 24th Symp. on Foundations of Computer Science, pp. 403–409, 1983.
Yelick, K. et al.: Parallel Data Structures for Symbolic Computation. Workshop on Parallel Symbolic Languages and Systems, Oct. 1995.
Yelick, K. et al.: Data Structures for Irregular Applications. DIMACS Workshop on Parallel Algorithms for Unstructured and Dynamic Problems, June 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, H., Welch, J.L. (2001). Randomized Shared Queues Applied to Distributed Optimization Algorithms. In: Eades, P., Takaoka, T. (eds) Algorithms and Computation. ISAAC 2001. Lecture Notes in Computer Science, vol 2223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45678-3_50
Download citation
DOI: https://doi.org/10.1007/3-540-45678-3_50
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42985-2
Online ISBN: 978-3-540-45678-0
eBook Packages: Springer Book Archive