Result: Revocable locks for non-blocking programming
Title:
Revocable locks for non-blocking programming
Authors:
Source:
PPoPP'05 (Proceedings of the 2005 ACM SIGPLAN symposium on principles and practice of parallel programming). :72-82
Publisher Information:
New York NY: ACM Press, 2005.
Publication Year:
2005
Physical Description:
print, 27 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie des langages et analyse syntaxique, Language theory and syntactical analysis, Logiciel, Software, Génie logiciel, Software engineering, Exclusion mutuelle, Mutual exclusion, Exclusión mutual, Extensibilité, Scalability, Estensibilidad, Gestion mémoire, Storage management, Gestión memoria, Langage parallèle, Parallel languages, Langage programmation, Programming language, Lenguaje programación, Simultanéité informatique, Concurrency, Simultaneidad informatica, Système exploitation, Operating system, Sistema operativo, Technique programmation, Programmation technique, Técnica programación, Mémoire transactionnelle, Non blocking algorithm
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Microsoft Research 7 J J Thomson Avenue, Cambridge, CB3 OFB, United Kingdom
University of Cambridge Computer Laboratory 15 JJ Thomson Avenue, Cambridge, CB3 OFD, United Kingdom
University of Cambridge Computer Laboratory 15 JJ Thomson Avenue, Cambridge, CB3 OFD, United Kingdom
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.18182672
Database:
PASCAL Archive
Further Information
In this paper we present a new form of revocable lock that streamlines the construction of higher level concurrency abstractions such as atomic multi-word heap updates. The key idea is to expose revocation by displacing the previous lock holder's execution to a safe address. This provides mutual exclusion without needing to block threads. This brings many simplifications, often removing the need for dynamic memory management and letting us strip operations from common-case execution paths. As well as streamlining algorithms' design, our results show that the technique leads to improved performance and scalability across a range of levels of contention.