A modular approach to shared-memory consensus, with applications to the probabilistic-write model

DOI10.1145/1835698.1835802zbMath1315.68013OpenAlexW1982218385MaRDI QIDQ5176221

James Aspnes

Publication date: 2 March 2015

Published in: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

randomizationdistributed computingshared memoryconsensus

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Randomized algorithms (68W20) Network protocols (68M12) Distributed algorithms (68W15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (3)

Agreeing within a few writes ⋮ A modular approach to shared-memory consensus, with applications to the probabilistic-write model ⋮ Tight bounds for adopt-commit objects

Uses Software

• CCSTM

Cites Work

• Elastic Transactions
• Toward a theory of transactional contention managers
• Software transactional memory

This page was built for publication: A modular approach to shared-memory consensus, with applications to the probabilistic-write model