Computing with infinitely many processes
DOI10.1016/J.IC.2013.11.007zbMATH Open1358.68218OpenAlexW1989119191MaRDI QIDQ391645FDOQ391645
Authors: 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
Recommendations
- scientific article; zbMATH DE number 1696673
- The concurrency hierarchy, and algorithms for unbounded concurrency
- From bounded to unbounded concurrency objects and back
- Resilient consensus for infinitely many processes. (Extended abstract)
- The mutual exclusion problem: part II---Statement and solutions
consensusmutual exclusionbounded concurrencyelectioninfinitely 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)
Cites Work
- Title not available (Why is that?)
- Renaming in an asynchronous environment
- Electing a leader in a synchronous ring
- Computing on an anonymous ring
- Title not available (Why is that?)
- Impossibility of distributed consensus with one faulty process
- Resilient consensus for infinitely many processes. (Extended abstract)
- Bounds on shared memory for mutual exclusion
- An efficient solution to the mutual exclusion problem using weak semaphores
- Speeding Lamport's fast mutual exclusion algorithm
- 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
- Title not available (Why is that?)
- The concurrency hierarchy, and algorithms for unbounded concurrency
- Wait-free consensus with infinite arrivals
- 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
Cited In (7)
- Title not available (Why is that?)
- Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers
- Computation as an unbounded process
- From bounded to unbounded concurrency objects and back
- The concurrency hierarchy, and algorithms for unbounded concurrency
- Active disk Paxos with infinitely many processes
- Coordination without prior agreement
This page was built for publication: Computing with infinitely many processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391645)
