Result: A pragmatic implementation of non-blocking linked-lists
Title:
A pragmatic implementation of non-blocking linked-lists
Authors:
Source:
DISC 2001 : distributed computing (Lisbon, 3-5 October 2001)Lecture notes in computer science. :300-314
Publisher Information:
Berlin: Springer, 2001.
Publication Year:
2001
Physical Description:
print, 15 ref
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, Logiciel, Software, Organisation des mémoires. Traitement des données, Memory organisation. Data processing, Traitement des données. Listes et chaînes de caractères, Data processing. List processing. Character string processing, Implémentation, Implementation, Ejecución, Linéarisation, Linearization, Linearización, Pragmatique, Pragmatics, Pragmatica linguístca, Structure donnée, Data structure, Estructura datos, Compare and swap, Liste reliée, Non blocking algorithm
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
University of Cambridge Computer Laboratory, Cambridge, United Kingdom
ISSN:
0302-9743
Rights:
Copyright 2002 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.14047101
Database:
PASCAL Archive
Further Information
We present a new non-blocking implementation of concurrent linked-lists supporting linearizable insertion and deletion operations. The new algorithm provides substantial benefits over previous schemes: it is conceptually simpler and our prototype operates substantially faster.