Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks

DOI10.1007/978-3-642-33651-5_20zbMath1377.68040OpenAlexW1498456247MaRDI QIDQ4909418

Prasad Jayanti, Zhiyu Liu

Publication date: 13 March 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33651-5_20

zbMATH Keywords

synchronizationconcurrent algorithmmutual exclusionRMR complexityabortabilityreader-writer exclusionshared-memory algorithm

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Distributed systems (68M14) Distributed algorithms (68W15)

This page was built for publication: Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks