A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
Nonblocking k-compare-single-swap
2003
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '03
The current literature offers two extremes of nonblocking software synchronization support for concurrent data structure design: intricate designs of specific structures based on single-location operations such as compare-and-swap (CAS), and general-purpose multilocation transactional memory implementations. While the former are sometimes efficient, they are invariably hard to extend and generalize. The latter are flexible and general, but costly. This paper aims at a middle ground: reasonably
doi:10.1145/777466.777468
fatcat:7qx5nm7o3bhn3oxxlr6mgamhju