SNZI: scalable NonZero indicators

Authors:
Faith Ellen;Yossi Lev;Victor Luchangco;Mark Moir
Affiliations:
University of Toronto;Brown University and Sun Microsystems Laboratories;Sun Microsystems Laboratories;Sun Microsystems Laboratories
Venue:
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Year:
2007

Citing 8
Cited 24

Efficient synchronization primitives for large-scale cache-coherent multiprocessors

ASPLOS III Proceedings of the third international conference on Architectural support for programming languages and operating systems
Linearizability: a correctness condition for concurrent objects

ACM Transactions on Programming Languages and Systems (TOPLAS)
Combining funnels: a dynamic approach to software combining

Journal of Parallel and Distributed Computing
Hierarchical Backoff Locks for Nonuniform Communication Architectures

HPCA '03 Proceedings of the 9th International Symposium on High-Performance Computer Architecture
Linearizable counting networks

Distributed Computing
Hybrid transactional memory

Proceedings of the 12th international conference on Architectural support for programming languages and operating systems
Composite abortable locks

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A hierarchical CLH queue lock

Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing

Scalable reader-writer locks

Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Model Checking Linearizability via Refinement

FM '09 Proceedings of the 2nd World Congress on Formal Methods
Early experience with a commercial hardware transactional memory implementation

Early experience with a commercial hardware transactional memory implementation
TLRW: return of the read-write lock

Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Simplifying concurrent algorithms by exploiting hardware transactional memory

Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
On maintaining multiple versions in STM

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Adaptive locks: Combining transactions and locks for efficient concurrency

Journal of Parallel and Distributed Computing
Why STM can be more than a research toy

Communications of the ACM
An analysis of Linux scalability to many cores

OSDI'10 Proceedings of the 9th USENIX conference on Operating systems design and implementation
An adaptive technique for constructing robust and high-throughput shared objects

OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Hybrid NOrec: a case study in the effectiveness of best effort hardware transactional memory

Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems
Adding concurrency in python using a commercial processor's hardware transactional memory support

ACM SIGARCH Computer Architecture News
Lightweight parallel accumulators using C++ templates

Proceedings of the 4th International Workshop on Multicore Software Engineering
Scalable automatic linearizability checking

Proceedings of the 33rd International Conference on Software Engineering
A nonblocking set optimized for querying the minimum value

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
CAFÉ: scalable task pools with adjustable fairness and contention

DISC'11 Proceedings of the 25th international conference on Distributed computing
What kinds of applications can benefit from transactional memory?

ISCA'10 Proceedings of the 2010 international conference on Computer Architecture
Leveraging the strengths of transactional memory while maintaining system performance for a multiplayer gaming application

ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
More anti-chain based refinement checking

ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
NUMA-aware reader-writer locks

Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming
RadixVM: scalable address spaces for multithreaded applications

Proceedings of the 8th ACM European Conference on Computer Systems
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles

ACM SIGOPS 24th Symposium on Operating Systems Principles
The scalable commutativity rule: designing scalable software for multicore processors

Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
Freeze after writing: quasi-deterministic parallel programming with LVars

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Quantified Score

Hi-index	0.02

Visualization

Abstract

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.