A Completeness Theorem for a Class of Synchronization Objects (Extended Abstract)


We study a class of synchronization objects in shared memory concurrent systems, which we call common2. This class contains r-ead-modify-wr-ife objects that commute (e.g. fetch-and-add), or overwrite (e.g. swap) and queue shared objects. It is known that this class is contained in the consensus number 2 class of objects [Her91a], and most of the commonly… (More)
DOI: 10.1145/164051.164071