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)
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
Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Bounds on the shared memory requirements for long-lived & adaptive objects (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
The BG distributed simulation algorithm
Distributed Computing
Adaptive and Efficient Algorithms for Lattice Agreement and Renaming
SIAM Journal on Computing
Adaptive Mutual Exclusion with Local Spinning
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Adaptive Long-Lived O(k2)-Renaming with O(k2) Steps
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Adaptive and efficient mutual exclusion
Distributed Computing
Algorithms adapting to point contention
Journal of the ACM (JACM)
Long-Lived Adaptive Collect with Applications
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Lower bounds for adaptive collect and related objects
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Long lived adaptive splitter and applications
Distributed Computing
An adaptive collect algorithm with applications
Distributed Computing
Adaptive solutions to the mutual exclusion problem
Distributed Computing
Hi-index | 0.00 |
Algorithms with step complexity that depends only on the point contention—the number of simultaneously active processes—are very attractive for distributed systems with varying degree of concurrency. Designing shared-memory algorithms that adapt to point contention, using only read and write operations, is however, a challenging task The paper specifies the long-lived safe agreement object, extending an object of Borowsky et al. [1], and describes an implementation whose step complexity is adaptive to point contention. Then, we illustrate how this object is used to solve other problems, like renaming and information collection, in an adaptive manner