Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
Scalable queue-based spin locks with timeout
Autore:
Scott, ML; Scherer, WN;
Indirizzi:
Univ Rochester, Dept Comp Sci, Rochester, NY 14627 USA Univ Rochester Rochester NY USA 14627 t Comp Sci, Rochester, NY 14627 USA
Titolo Testata:
ACM SIGPLAN NOTICES
fascicolo: 7, volume: 36, anno: 2001,
pagine: 44 - 52
SICI:
1523-2867(200107)36:7<44:SQSLWT>2.0.ZU;2-8
Fonte:
ISI
Lingua:
ENG
Soggetto:
SHARED-MEMORY MULTIPROCESSORS; SYNCHRONIZATION; ALGORITHMS;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
Citazioni:
9
Recensione:
Indirizzi per estratti:
Indirizzo: Scott, ML Univ Rochester, Dept Comp Sci, Rochester, NY 14627 USA Univ Rochester Rochester NY USA 14627 , Rochester, NY 14627 USA
Citazione:
M.L. Scott e W.N. Scherer, "Scalable queue-based spin locks with timeout", ACM SIGPL N, 36(7), 2001, pp. 44-52

Abstract

Queue-based spin locks allow programs with busy-wait synchronization to scale to very large multiprocessors, without fear of starvation or performance-destroying contention. So-called try locks, traditionally based on non-scalable test-and-set locks, allow a process to abandon its attempt to acquire a lock after a given amount of time. The process can then pursue an alternative code path, or yield the processor to some other process. We demonstrate that it is possible to obtain both scalability and bounded waiting, using variants of the queue-based locks of Craig, Landin, and Hagersten, and of Mellor-Crummey and Scott. A process that decides to stop waiting for one of these new locks can "link itself out of line" atomically. Single-processor experiments reveal performance penalties of 50-100% for the CLH and MCS try locks in comparison to their standard versions, this marginal cost decreases with larger numbers of processors. We have also compared our queue-based locks to a. traditional test-and-test;-and-set lock with exponential backoff and timeout. At modest (non-zero) levels of contention, the queued locks sacrifice cache locality for fairness, resulting in a worst-case 3X performance penalty. At high levels of contention, however, they display a 1.5-2X performance advantage, with significantly more regular timings and significantly higher rates of acquisition prior to timeout.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 19/01/20 alle ore 14:58:34