Algorithms for mutual exclusion
Algorithms for mutual exclusion
Algorithms for scalable synchronization on shared-memory multiprocessors
ACM Transactions on Computer Systems (TOCS)
Scalable reader-writer synchronization for shared-memory multiprocessors
PPOPP '91 Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming
Alpha architecture reference manual
Alpha architecture reference manual
A simple local-spin group mutual exclusion algorithm
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Adaptive and efficient mutual exclusion (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
Solution of a problem in concurrent programming control
Communications of the ACM
Scalable queue-based spin locks with timeout
PPoPP '01 Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programming
Parallel Computer Architecture: A Hardware/Software Approach
Parallel Computer Architecture: A Hardware/Software Approach
Non-blocking timeout in scalable queue-based spin locks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
f-arrays: implementation and applications
Proceedings of the twenty-first annual symposium on Principles of distributed computing
The Performance of Spin Lock Alternatives for Shared-Memory Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Adaptive Mutual Exclusion with Local Spinning
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
Efficient and practical constructions of LL/SC variables
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Adaptive solutions to the mutual exclusion problem
Distributed Computing
POWER4 system microarchitecture
IBM Journal of Research and Development
Efficient and practical constructions of LL/SC variables
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Abortable and query-abortable objects and their efficient implementation
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Brief Announcement: Local-Spin Algorithms for Abortable Mutual Exclusion and Related Problems
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Self-stabilizing philosophers with generic conflicts
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
The semantics of progress in lock-based transactional memory
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Randomized mutual exclusion in O(log N / log log N) RMRs
Proceedings of the 28th ACM symposium on Principles of distributed computing
Proceedings of the 5th European conference on Computer systems
Group mutual exclusion in O(log n) RMR
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Adaptive randomized mutual exclusion in sub-logarithmic expected time
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Constant RMR solutions to reader writer synchronization
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Brief announcement: fast local-spin abortable mutual exclusion with bounded space
DISC'10 Proceedings of the 24th international conference on Distributed computing
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Fast local-spin abortable mutual exclusion with bounded space
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Looking for efficient implementations of concurrent objects
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
Preemption adaptivity in time-published queue-based spin locks
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
A practical single-register wait-free mutual exclusion algorithm on asynchronous networks
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
A tight RMR lower bound for randomized mutual exclusion
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation
On the cost of composing shared-memory algorithms
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Brief announcement: a tight RMR lower bound for randomized mutual exclusion
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
RMR-efficient randomized abortable mutual exclusion
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Abortable reader-writer locks are no more complex than abortable mutex locks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Introducing speculation in self-stabilization: an application to mutual exclusion
Proceedings of the 2013 ACM symposium on Principles of distributed computing
An O(1)-barriers optimal RMRs mutual exclusion algorithm: extended abstract
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Hi-index | 0.00 |
Scott and Scherer recently pointed out that existing locking algorithms do not meet a need that arises in practical systems. Specifically, database systems and real time systems need mutual exclusion locks that support the abort capability, which makes it possible for a process that waits "too long" to abort its attempt to acquire the lock. Further, to ensure high performance in cache coherent and NUMA multiprocessors, the locking algorithm should generate as few remote references as possible.To help meet this need, Scott and Scherer in 2001 and Scott in 2002 proposed some local-spin abortable mutual exclusion algorithms, but these algorithms have Shortcomings. Specifically, the algorithm by Scott and Scherer allows an aborting process to be blocked by other processes, which is unacceptable. The subsequent algorithms by Scott overcome this shortcoming, but these have unbounded worst-case time and space complexity.In this paper, we present art efficient local-spin algorithm with the following complexity: in each acquisition and release/abort of the lock, a process makes O(min(k, log n)) remote memory references, where k is the point contention and n is the total number of processes for which the lock is designed. Thus, not only is the algorithm adaptive, but also its worst-case time complexity has a small logarithmic bound. The algorithm has O(n) space complexity. To our knowledge, this is the first abortable mutual exclusion algorithm that has bounded time complexity and requires only a bounded number of memory words.