SNZI, scalable nonzero indicators

DOI10.1145/1281100.1281106MaRDI QIDQ5401388zbMATH OpenOpenAlexFDO

Authors Faith Ellen, Yossi Lev, Victor Luchangco, Mark Moir

Publication date 13 March 2014

Published in Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1281100.1281106

zbMATH Keywords

scalabilitycounterstransactional memory

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Distributed systems (68M14) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of operating systems (68N25)

Recommendations

• Software transactional memory
• Constructing Shared Objects That Are Both Robust and High-Throughput
• Concurrent counting (extended abstract)
• Time-Lapse Snapshots
• scientific article; zbMATH DE number 1263230

Cited in

(4)

• Bounded-wait combining: constructing robust and high-throughput shared objects
• SNZI
• Adaptive locks: combining transactions and locks for efficient concurrency
• The mailbox problem

This page was built for publication: SNZI, scalable nonzero indicators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5401388)