An adaptive collect algorithm with applications
From MaRDI portal
Publication:5138374
Recommendations
- Efficient adaptive collect algorithms
- Distributed Computing
- Efficient Adaptive Collect Using Randomization
- Efficient adaptive collect using randomization
- Distributed Computing
- Lower bounds for adaptive collect and related objects
- An efficient adaptive dynamic algorithm
- Adaptive aggregation on graphs
- Adaptive approximations by greedy algorithms
- Adaptive greedy approximations
Cites work
- Adaptive and efficient algorithms for lattice agreement and renaming
- Adaptive solutions to the mutual exclusion problem
- Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract)
- Atomic Snapshots in O (n log n) Operations
- Atomic snapshots using lattice agreement
- Bounded round number
- scientific article; zbMATH DE number 1696672 (Why is no real title available?)
- scientific article; zbMATH DE number 1263230 (Why is no real title available?)
- Immediate atomic snapshots and fast renaming
- Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)
- Long-lived renaming made fast
- Renaming in an asynchronous environment
- The Instancy of Snapshots and Commuting Objects
- The mutual exclusion problem. I: A theory of interprocess communication
- Using local-spin \(k\)-exclusion algorithms to improve wait-free object implementations
- Wait-free k-set agreement is impossible
- Wait-free algorithms for fast, long-lived renaming
Cited in
(18)- On the cost of uniform protocols whose memory consumption is adaptive to interval contention
- Efficient adaptive collect using randomization
- Efficient adaptive collect algorithms
- Store-collect in the presence of continuous churn with application to snapshots and lattice agreement
- Adaptive and efficient algorithms for lattice agreement and renaming
- Space- and time-adaptive nonblocking algorithms
- Algorithms adapting to point contention
- Spreading Rumors Rapidly Despite an Adversary
- Compositional competitiveness for distributed algorithms
- Linear space bootstrap communication schemes
- Poly-logarithmic adaptive algorithms require unconditional primitives
- Distributed Computing
- Distributed Computing
- Efficient Adaptive Collect Using Randomization
- Lower bounds for adaptive collect and related objects
- Optimal resilience in systems that mix shared memory and message passing
- The complexity of full-information iterated protocols
- Adaptive progress: a gracefully-degrading liveness property
This page was built for publication: An adaptive collect algorithm with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138374)
