Computing with infinitely many processes

DOI10.1016/J.IC.2013.11.007MaRDI QIDQ391645zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

consensusmutual exclusionbounded concurrencyelectioninfinitely many processesnamingunbounded concurrency

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

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

Cites work

• scientific article; zbMATH DE number 1696664 (Why is no real title available?)
• scientific article; zbMATH DE number 1696673 (Why is no real title available?)
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• Active disk Paxos with infinitely many processes
• Adaptive and efficient mutual exclusion
• Adaptive solutions to the mutual exclusion problem
• An efficient solution to the mutual exclusion problem using weak semaphores
• Bounds on shared memory for mutual exclusion
• Computing in totally anonymous asynchronous shared memory systems
• Computing on an anonymous ring
• Contention-free complexity of shared memory algorithms
• Data Requirements for Implementation of N -Process Mutual Exclusion Using a Single Shared Variable
• Electing a leader in a synchronous ring
• Impossibility of distributed consensus with one faulty process
• Long lived adaptive splitter and applications
• Public data structures: counters as a special case.
• Renaming in an asynchronous environment
• Resilient consensus for infinitely many processes. (Extended abstract)
• Speeding Lamport's fast mutual exclusion algorithm
• The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms
• The concurrency hierarchy, and algorithms for unbounded concurrency
• Time/contention trade-offs for multiprocessor synchronization
• Wait-free algorithms for fast, long-lived renaming
• Wait-free consensus with infinite arrivals

Cited in

(7)

• Coordination without prior agreement
• scientific article; zbMATH DE number 1696673 (Why is no real title available?)
• 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

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)