A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Pragmatic primitives for non-blocking data structures
2013
Proceedings of the 2013 ACM symposium on Principles of distributed computing - PODC '13
We define a new set of primitive operations that greatly simplify the implementation of non-blocking data structures in asynchronous shared-memory systems. The new operations operate on a set of Data-records, each of which contains multiple fields. The operations are generalizations of the well-known load-link (LL) and store-conditional (SC) operations, which we call LLX and SCX. The LLX operation takes a snapshot of one Data-record. An SCX operation by a process p succeeds only if no
doi:10.1145/2484239.2484273
dblp:conf/podc/BrownER13
fatcat:kfi3khic4jg47o7igzdrtlnlzy