Abstract
We introduce a new object, BH, and prove that a system with one BH object and single-writer Registers has the same computational power as a system with countably many commutative and overwriting objects. This provides a simple characterization of the class of objects that can be implemented from commutative and overwriting objects, and creates a potential tool for proving impossibility results.
It has been conjectured that Stacks and Queues shared by three or more processes are not in this class. In this paper, we use a BH object to show that two different restricted versions of Stacks are in this class. Specifically, we give an implementation of a Stack that supports any number of poppers, but at most two pushers. We also implement a Stack (or Queue) shared by any number of processes, but, in which, all stored elements are the same.
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
Afek, Y., Weisberger, E., Weisman, H.: A completeness theorem for a class of synchronization objects. In: Proceedings of the 12th ACM Symposium on Principles of Distributed Computing, pp. 159–170 (1993)
David, M.: A single-enqueuer wait-free queue implementation. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol. 3274, pp. 132–143. Springer, Heidelberg (2004)
David, M.: Wait-free linearizable queue implementations. Master’s thesis, Univ. of Toronto (2004)
Herlihy, M.: Wait-free synchronization. ACM Transactions on Programming Languages and Systems 13(1), 124–149 (1991)
Herlihy, M., Wing, J.: Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems 12(3), 495–504 (1990)
Li, Z.: Non-blocking implementation of queues in asynchronous distributed shared-memory systems. Master’s thesis, Univ. of Toronto (2001)
Vitanyi, P., Awerbuch, B.: Atomic shared register access by asynchronous hardware. In: Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, pp. 233–243 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
David, M., Brodsky, A., Fich, F.E. (2005). Restricted Stack Implementations. In: Fraigniaud, P. (eds) Distributed Computing. DISC 2005. Lecture Notes in Computer Science, vol 3724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561927_12
Download citation
DOI: https://doi.org/10.1007/11561927_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29163-3
Online ISBN: 978-3-540-32075-3
eBook Packages: Computer ScienceComputer Science (R0)