A fast mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Renaming in an asynchronous environment
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Atomic snapshots of shared memory
Journal of the ACM (JACM)
Immediate atomic snapshots and fast renaming
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Generalized FLP impossibility result for t-resilient asynchronous computations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Wait-free algorithms for fast, long-lived renaming
Science of Computer Programming
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Capturing the power of resiliency and set consensus in distributed systems
Capturing the power of resiliency and set consensus in distributed systems
Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Atomic Snapshots in O (n log n) Operations
SIAM Journal on Computing
Fast, long-lived renaming improved and simplified
Science of Computer Programming
Long-lived renaming made adaptive
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Fast, wait-free (2k-1)-renaming
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
The instancy of snapshots and commuting objects
Journal of Algorithms
Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
SIAM Journal on Computing
Adaptive and Efficient Algorithms for Lattice Agreement and Renaming
SIAM Journal on Computing
The Combinatorial Structure of Wait-free Solvable Tasks (Extended Abstract)
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Polynominal and Adaptive Long-Lived (2k-1)-Renaming
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Long-Lived Adaptive Collect with Applications
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Atomic snapshots using lattice agreement
Distributed Computing
Using local-spin k-exclusion algorithms to improve wait-free object implementations
Distributed Computing
Adaptive solutions to the mutual exclusion problem
Distributed Computing
Algorithms adapting to point contention
Journal of the ACM (JACM)
On using network attached disks as shared memory
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Collective asynchronous reading with polylogarithmic worst-case overhead
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Lower bounds for adaptive collect and related objects
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Wait-free computing: an introductory lecture
Future Generation Computer Systems - Special issue: Parallel computing technologies
Single-scanner multi-writer snapshot implementations are fast!
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Efficient adaptive collect using randomization
Distributed Computing - Special issue: DISC 04
On the cost of uniform protocols whose memory consumption is adaptive to interval contention
Theoretical Computer Science
Wait-free computing: an introductory lecture
Future Generation Computer Systems - Special issue: Parallel computing technologies
Help when needed, but no more: efficient read/write partial snapshot
DISC'09 Proceedings of the 23rd international conference on Distributed computing
On the power of hardware transactional memory to simplify memory management
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Help when needed, but no more: Efficient read/write partial snapshot
Journal of Parallel and Distributed Computing
Performing dynamically injected tasks on processes prone to crashes and restarts
DISC'11 Proceedings of the 25th international conference on Distributed computing
On the cost of uniform protocols whose memory consumption is adaptive to interval contention
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Adapting to point contention with long-lived safe agreement
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Polylogarithmic concurrent data structures from monotone circuits
Journal of the ACM (JACM)
How hard is it to take a snapshot?
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Space and step complexity efficient adaptive collect
DISC'05 Proceedings of the 19th international conference on Distributed Computing
An efficient long-lived adaptive collect algorithm
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Can memory be used adaptively by uniform algorithms?
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Adaptive algorithms using bounded memory are inherently non-uniform
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
From a store-collect object and Ω to efficient asynchronous consensus
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
| Hi-index | 0.00 |
In a shared-memory distributed system, n independent asynchronous processes communicate by reading and writing to shared variables. An algorithm is adaptive (to total contention) if its step complexity depends only on the actual number, k, of active processes in the execution; this number is unknown in advance and may change in different executions of the algorithm. Adaptive algorithms are inherently wait-free, providing fault-tolerance in the presence of an arbitrary number of crash failures and different processes' speed.A wait-free adaptive collect algorithm with O(k) step complexity is presented, together with its applications in wait-free adaptive algorithms for atomic snapshots, immediate snapshots and renaming.