Randomized wait-free concurrent objects (extended abstract)
From MaRDI portal
Publication:5255802
DOI10.1145/112600.112602zbMath1314.68380OpenAlexW2027014911MaRDI QIDQ5255802
Publication date: 19 June 2015
Published in: Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/112600.112602
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Data structures (68P05) Distributed systems (68M14) Randomized algorithms (68W20) Distributed algorithms (68W15)
Related Items
Composite registers, Open consensus, Model checking transactional memories, The \(k\)-simultaneous consensus problem, Solo-valency and the cost of coordination, Bounded-wait combining: constructing robust and high-throughput shared objects, Efficient algorithms for checking the atomicity of a run of read and write operations, A timing assumption and two \(t\)-resilient protocols for Implementing an eventual leader service in asynchronous shared memory systems, Tight Bounds for Asynchronous Renaming, The space complexity of unbounded timestamps, Primitives for asynchronous list compression, Inter-process buffers in separation logic with rely-guarantee, RMR-efficient implementations of comparison primitives using read and write operations, A modular approach to shared-memory consensus, with applications to the probabilistic-write model, Renaming and the weakest family of failure detectors, Implementing sequentially consistent programs on processor consistent platforms, Lock-free deques and doubly linked lists, Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler, Lock-free dynamic hash tables with open addressing, Active disk Paxos with infinitely many processes, Tight bounds for shared memory systems accessed by Byzantine processes, Efficient adaptive collect using randomization, Anonymous and fault-tolerant shared-memory computing, Common2 extended to stacks and unbounded concurrency, Failure detectors as type boosters, The weakest failure detectors to boost obstruction-freedom, Introduction à l'algorithmique des objets partagés, Atomic snapshots using lattice agreement, Randomized two-process wait-free test-and-set, The mailbox problem, Threshold protocols in survivor set systems, On set consensus numbers, The complexity of updating snapshot objects, Help when needed, but no more: efficient read/write partial snapshot, A scalable lock-free stack algorithm, Combining shared-coin algorithms, Transactional memory, A criterion for atomicity, Distributed agreement in tile self-assembly, Nonblocking \(k\)-compare-single-swap, Unnamed Item, Adaptive progress: a gracefully-degrading liveness property, Refined quorum systems, NB{\texttt{malloc}}: Allocating memory in a lock-free manner, Trace-based derivation of a scalable lock-free stack algorithm, Sub-logarithmic Test-and-Set against a Weak Adversary, Online search with time-varying price bounds, Wait-free implementations in message-passing systems
