Wait-freedom vs. bounded wait-freedom in public data structures

7Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.

Abstract

In this paper we define and study public data structures, which are concurrent data structures in the shared memory environment, which enable access to an unknown (and possibly infinite) set of identical processes. Specific cases of such data structures (like counting networks and concurrent counters) have been studied recently, and such data structures seems to model concurrent systems like server-clients applications, in which the identities of the clients, and sometimes also their number, are not known apriori. Specifically, we study the relation between wait-free and bounded wait-free public data structures - the former guarantees that every operation performed on the data structure always terminates, regardless the relative speed of the processes; the latter guarantees that every such operation is terminated within a fixed number of steps. We present an example of a public data structure which is wait-free but not bounded wait-free, and then we show that if all the concurrent objects of the data structure are periodic, then waitfreedom implies bounded wait-freedom.

Cite

CITATION STYLE

APA

Brit, H., & Moran, S. (1994). Wait-freedom vs. bounded wait-freedom in public data structures. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (Vol. Part F129432, pp. 52–60). Association for Computing Machinery. https://doi.org/10.1145/197917.197950

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free