| P. S. Magnusson, A. Landin, and E. Hagersten. Queue locks on cache coherent multiprocessors. 8th Intl. Parallel Processing Symp., Apr. 1994. |
....the longer they have waited. The more advanced queue based locks instead maintain a first come, first served order between the contending threads. Each contender will only spin on the dedicated flag set at its predecessor s release of the lock, and contenders ordered after it will not be affected [5, 16, 18]. However, the complicated software queuing locks are less efficient for uncontested locks, which have led to the creation of even more complicated adaptive hybrid proposals in the quest for a general purpose solution [14] Shared memory architectures with a nonuniform memory access time to the ....
....The software only locking primitives we directly compare are the following: 1. TATAS : traditional test and test set lock 2. TATAS EXP : TATAS with exponential backoff 3. MCS: queue based locks of Mellor Crummey and Scott [18] 4. CLH: queue based locks of Craig, Landin, and Hagersten [5, 16] 5. RH: our proof of concept NUCA aware lock [20] 6. HBO: our new NUCA aware spin lock with hierarchical backoff (see section 4.1) 7. HBO GT: HBO with global traffic throttling (see section 4.2) 8. HBO GT SD: HBO GT with starvation detection (see section 4.3) We also present a short ....
[Article contains additional citation context not shown here]
P. Magnusson, A. Landin, and E. Hagersten. Queue Locks on Cache Coherent Multiprocessors. In Proceedings of the 8th International Parallel Processing Symposium, pages 165--171, Cancun, Mexico, Apr. 1994.
No context found.
P. S. Magnusson, A. Landin, and E. Hagersten. Queue locks on cache coherent multiprocessors. 8th Intl. Parallel Processing Symp., Apr. 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC