Work

Locking without blocking: making lock based concurrent data structure algorithms nonblocking

Year: 1992

Type: conference-paper

Abstract: Nonblocking algorithms for concurrent data structures guarantee that a data structure is always accessible. This is in contrast to blocking algorithms in which a slow or halted process can render part or all of the data structure inaccessible to other processes.

Source: ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS)

DOI: 10.1145/137097.137873

Authors: John Turek, Dennis Shasha, Sundeep Prakash

Institutions: IBM (United States), University of California, Los Angeles, Courant Institute of Mathematical Sciences, IBM Research - Thomas J. Watson Research Center, New York University

Language: English

Topic: Distributed systems and fault tolerance

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W1977692753

FWCI: 3.1

Cites: 12

Cited by: 93

Related to: 10