Computing with infinitely many processes
From MaRDI portal
Publication:391645
DOI10.1016/j.ic.2013.11.007zbMath1358.68218OpenAlexW1989119191MaRDI QIDQ391645
Michael Merritt, Gadi Taubenfeld
Publication date: 10 January 2014
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2013.11.007
consensusmutual exclusionelectionbounded concurrencyinfinitely many processesnamingunbounded concurrency
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient solution to the mutual exclusion problem using weak semaphores
- Speeding Lamport's fast mutual exclusion algorithm
- Bounds on shared memory for mutual exclusion
- Public data structures: counters as a special case.
- Computing in totally anonymous asynchronous shared memory systems
- Wait-free algorithms for fast, long-lived renaming
- Time/contention trade-offs for multiprocessor synchronization
- Contention-free complexity of shared memory algorithms
- The concurrency hierarchy, and algorithms for unbounded concurrency
- Renaming in an asynchronous environment
- Wait-free consensus with infinite arrivals
- Impossibility of distributed consensus with one faulty process
- Electing a leader in a synchronous ring
- Computing on an anonymous ring
- Data Requirements for Implementation of N -Process Mutual Exclusion Using a Single Shared Variable
- Adaptive solutions to the mutual exclusion problem
- Long lived adaptive splitter and applications
- Adaptive and efficient mutual exclusion
- Active disk paxos with infinitely many processes
- The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms
- Distributed Computing
This page was built for publication: Computing with infinitely many processes
