We define a class of shared objects called snapshot objects, and give a necessary and sufficient condition for the existence of a waitfree implementation of such objects from atomic registers. Snapshot objects can be accessed by means of a read operation that returns the entire object state, or by a set of operations that do not return values. Our condition for the existence of a wait-free implementation requires that for any pair of operation invocations, either the two invocations commute or one overwrites the other.
CITATION STYLE
Anderson, J. H., & Moir, M. (1993). Towards a necessary and sufficient condition for wait-free synchronization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 725 LNCS, pp. 39–53). Springer Verlag. https://doi.org/10.1007/3-540-57271-6_26
Mendeley helps you to discover research relevant for your work.