The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers
Conference proceeding (June 2024)
Concurrent Programming: Algorithms, Principles, and Foundations
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 The Mutual Exclusion Problem
-
Altmetric BadgeChapter 2 Solving Mutual Exclusion
-
Altmetric BadgeChapter 3 Lock-Based Concurrent Objects
-
Altmetric BadgeChapter 4 Atomicity: Formal Definition and Properties
-
Altmetric BadgeChapter 5 Mutex-Free Concurrent Objects
-
Altmetric BadgeChapter 6 Hybrid Concurrent Objects
-
Altmetric BadgeChapter 7 Wait-Free Objects from Read/Write Registers Only
-
Altmetric BadgeChapter 8 Snapshot Objects from Read/Write Registers Only
-
Altmetric BadgeChapter 9 Renaming Objects from Read/Write Registers Only
-
Altmetric BadgeChapter 10 Transactional Memory
-
Altmetric BadgeChapter 11 Safe, Regular, and Atomic Read/Write Registers
-
Altmetric BadgeChapter 12 From Safe Bits to Atomic Bits: Lower Bound and Optimal Construction
-
Altmetric BadgeChapter 13 Bounded Constructions of Atomic b -Valued Registers
-
Altmetric BadgeChapter 14 Universality of Consensus
-
Altmetric BadgeChapter 15 The Case of Unreliable Base Objects
-
Altmetric BadgeChapter 16 Consensus Numbers and the Consensus Hierarchy
-
Altmetric BadgeChapter 17 The Alpha(s) and Omega of Consensus: Failure Detector-Based Consensus