תקציר
A public data structure is required to work correctly in a concurrent environment where many processes may try to access it, possibly at the same time. In implementing such a structure nothing can be assumed in advance about the number or the identities of the processes that might access it. While most of the known concurrent data structures are not public, there are few which are public. Interestingly, these public data structures all deal with various variants of counters, which are data structures that support two operations: increment and read. In this paper, we define the notion of a public data structure, and investigate several types of public counters. Then we give an optimal construction of public counters which satisfies a weak correctness condition, and show that there is no public counter which satisfies a stronger condition. It is hoped that this work will provide insights into the design of other, more complicated, public data structures.
| שפה מקורית | אנגלית |
|---|---|
| עמודים (מ-עד) | 401-423 |
| מספר עמודים | 23 |
| כתב עת | Theoretical Computer Science |
| כרך | 289 |
| מספר גיליון | 1 |
| מזהי עצם דיגיטלי (DOIs) | |
| סטטוס פרסום | פורסם - 23 אוק׳ 2002 |
הערה ביבליוגרפית
Funding Information:A preliminary version of this work appeared in the Proc. 3rd Israel Symp. on the Theory of Computing and Systems, Tel Aviv, January 1995. ∗Corresponding author. E-mail address: [email protected] (S. Moran). 1This research was supported in part by the fund for promotion of the research in the Technion. 2Part of the work was done while the author was working for AT& T Bell Laboratories.