TY - GEN
T1 - Tracking in Order to Recover - Detectable Recovery of Lock-Free Data Structures
AU - Attiya, Hagit
AU - Ben-Baruch, Ohad
AU - Fatourou, Panagiota
AU - Hendler, Danny
AU - Kosmas, Eleftherios
N1 - Funding Information:
∗Supported in part by ISF grant 380/18. †This research is co-financed by Greece and the European Union (European Social Fund-ESF) through the Operational Programme «Human Resources Development, Education and Lifelong Learning» in the context of the project “Reinforcement of Postdoctoral Researchers - 2nd Cycle” (MIS-5033021), implemented by the State Scholarships Foundation (IKY) Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the owner/author(s). SPAA ’20, July 15–17, 2020, Virtual Event, USA © 2020 Copyright held by the owner/author(s). ACM ISBN 978-1-4503-6935-0/20/07. https://doi.org/10.1145/3350755.3400257
Publisher Copyright:
© 2020 Owner/Author.
PY - 2020/7/6
Y1 - 2020/7/6
N2 - We present the tracking approach for deriving detectable implementations of many widely-used concurrent data structures for systems with non-volatile main memory (NVRAM). Detectable recovery ensures that in the crash-recovery model, every operation executed during a crash, resumes its execution and returns a correct response, and that the state of the data structure is not corrupted.
AB - We present the tracking approach for deriving detectable implementations of many widely-used concurrent data structures for systems with non-volatile main memory (NVRAM). Detectable recovery ensures that in the crash-recovery model, every operation executed during a crash, resumes its execution and returns a correct response, and that the state of the data structure is not corrupted.
KW - detectability
KW - non-volatile memory
KW - recoverable algorithms
UR - http://www.scopus.com/inward/record.url?scp=85088656288&partnerID=8YFLogxK
U2 - 10.1145/3350755.3400257
DO - 10.1145/3350755.3400257
M3 - Conference contribution
AN - SCOPUS:85088656288
T3 - Annual ACM Symposium on Parallelism in Algorithms and Architectures
SP - 503
EP - 505
BT - SPAA 2020 - Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures
PB - Association for Computing Machinery
T2 - 32nd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2020
Y2 - 15 July 2020 through 17 July 2020
ER -