Asynchronous coordination under preferences and constraints
From MaRDI portal
Recommendations
Cites work
- Atomic snapshots of shared memory
- Bounds for Multiprocessor Scheduling with Resource Constraints
- Concurrent programming: algorithms, principles, and foundations.
- Distributed computing by mobile robots: gathering
- Distributed computing through combinatorial topology
- From adaptive renaming to set agreement
- Generalized FLP impossibility result for t-resilient asynchronous computations
- scientific article; zbMATH DE number 1179121 (Why is no real title available?)
- Immediate atomic snapshots and fast renaming
- Multicoloring trees.
- Musical Chairs
- Mutual exclusion scheduling
- Oblivious Collaboration
- Renaming in an asynchronous environment
- Restrictions of graph partition problems. I
- Scheduling with conflicts: Online and offline algorithms
- The renaming problem in shared memory systems: an introduction
- The topological structure of asynchronous computability
- Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
Cited in
(3)
This page was built for publication: Asynchronous coordination under preferences and constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835020)