Metraipolis › archive › dc_96c5455b2dcc
Array Based Queuing Locks — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Array_Based_Queuing_Locks
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-11-09T23:44:36.190Z
- SHA-256 of the archived text
ae17237d3726723ddffedc0ccd7493fa82624183d0f3a14c8564cdd62042450f- Stable URL of this page
https://metraipolis.com/documento/dc_96c5455b2dcc
How to cite
Array Based Queuing Locks — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Array_Based_Queuing_Locks (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_96c5455b2dcc (Metraipolis archive dc_96c5455b2dcc, sha256 ae17237d3726723ddffedc0ccd7493fa82624183d0f3a14c8564cdd62042450f)
BibTeX
@misc{dc96c5455b2dcc,
title = {Array Based Queuing Locks — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Array_Based_Queuing_Locks},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_96c5455b2dcc; sha256 ae17237d3726723ddffedc0ccd7493fa82624183d0f3a14c8564cdd62042450f},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Array_Based_Queuing_Locks. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In concurrent programming, an Array-Based Queuing Lock (ABQL) is a synchronization mechanism used to control access to shared resources and ensure fairness among competing threads. It is a variation of the ticket lock algorithm. Traditional locking mechanisms often involve threads contending for a single lock variable (a shared data element used to control access). In contrast, an ABQL uses an array to represent a queue of waiting threads. Each thread, upon attempting to acquire the lock, is assigned a unique position, or "slot," in this array. This approach significantly improves scalability and fairness because threads spin on their individual array slots rather than a single shared location, reducing contention and ensuring a first-come, first-served acquisition order. This distributed spinning also minimizes cache coherency traffic (the communication required to keep data consistent across multiple processor cores' caches), which further enhances performance, especially in multi-core and multi-processor systems. Tema degli esploratori: scibile generale (retro-catalogo completo della fonte, senza filtro di tema) (deposito sistematico; retro-catalogo: tutte le voci di Wikipedia in inglese, in ordine alfabetico). Fonte: Wikipedia in inglese, voce «Array Based Queuing Locks» — https://en.wikipedia.org/wiki/Array_Based_Queuing_Locks Wikidata Q28403306: «type of spinlock» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q28403306 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Array_Based_Queuing_Locks?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1348975888, consultata il 2026-11-09T23:41:32.003Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 4f5a25379256f740807f4e6146c8a813f3c5809f93b78ce81d7199314a4a362a