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
.
Mindicators: A Scalable Approach to Quiescence
2013
2013 IEEE 33rd International Conference on Distributed Computing Systems
We introduce the Mindicator, a new shared object that is optimized for querying the minimum value of a set of values proposed by several processes. A mindicator may hold at most one value per process. This interface is designed for use in shared memory runtime systems, such as garbage collectors, software transactional memory (TM), and operating system kernels. We introduce linearizable and relaxed mindicator implementations, both of which are lock-free. Our algorithms employ a tree structure,
doi:10.1109/icdcs.2013.39
dblp:conf/icdcs/LiuLS13
fatcat:bkrx5kglyzd5vah6ay66u35wne