The Community for Technology Leaders
RSS Icon
Issue No.09 - September (1997 vol.8)
pp: 926-933
<p><b>Abstract</b>—In this paper, we present the PR lock, a prioritized spin lock mutual exclusion algorithm. The PR lock is a contention-free spin lock, in which blocked processes spin on locally stored or cached variables. In contrast to previous work on prioritized spin locks, our algorithm maintains a pointer to the lock holder. As a result, our spin lock can support operations on the lock holder (e.g., for abort ceiling protocols). Unlike previous algorithms, all work to maintain a priority queue is done while a process acquires a lock when it is blocked anyway. Releasing a lock is a constant time operation. We present simulation results that demonstrate the prioritized acquisition of locks, and compare the performance of the PR lock against that of the best alternative prioritized spin lock.</p>
Mutual exclusion, parallel processing, real-time system, spin lock, priority queue.
Theodore Johnson, "A Prioritized Multiprocessor Spin Lock", IEEE Transactions on Parallel & Distributed Systems, vol.8, no. 9, pp. 926-933, September 1997, doi:10.1109/71.615438
34 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool