SNZI
SNZI: scalable NonZero indicators. We introduce the SNZI shared object, which is related to traditional shared counters, but has weaker semantics. We also introduce a resettable version of SNZI called SNZI-R. We present implementations that are scalable, linearizable, nonblocking, and fast in the absence of contention, properties that are difficult or impossible to achieve simultaneously with the stronger semantics of traditional counters. Our primary motivation in introducing SNZI and SNZI-R is to use them to improve the performance and scalability of software and hybrid transactional memory systems. We present performance experiments showing that our implementations have excellent performance characteristics for this purpose.
This software is also peer reviewed by journal TOMS.
This software is also peer reviewed by journal TOMS.
Keywords for this software
References in zbMATH (referenced in 5 articles , 1 standard article )
Showing results 1 to 5 of 5.
Sorted by year (- Brown, Trevor: A template for implementing fast lock-free trees using HTM (2017)
- Aguilera, Marcos K.; Gafni, Eli; Lamport, Leslie: The mailbox problem (2010)
- Usui, Takayuki; Behrends, Reimer; Evans, Jacob; Smaragdakis, Yannis: Adaptive locks: combining transactions and locks for efficient concurrency (2010)
- Hendler, Danny; Kutten, Shay: Bounded-wait combining: constructing robust and high-throughput shared objects (2009)
- Ellen, Faith; Lev, Yossi; Luchangco, Victor; Moir, Mark: SNZI, scalable nonzero indicators (2007)