Concurrent programming without locks

Abstract

Mutual exclusion locks remain the de facto mechanism for concurrency control on shared-memory data structures. However, their apparent simplicity is deceptive: It is hard to design scalable locking strategies because locks can harbor problems such as priority inversion, deadlock, and convoying. Furthermore, scalable lock-based systems are not readily… (More)
DOI: 10.1145/1233307.1233309

16 Figures and Tables

Topics

Statistics

02040'05'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

245 Citations

Semantic Scholar estimates that this publication has 245 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics