Brief Announcement: Persistent Multi-Word Compare-and-Swap

This brief announcement presents a fundamental concurrent primitive for persistent memory - a persistent atomic multi-word compare-and-swap (PMCAS). We present a novel algorithm carefully crafted to ensure that atomic updates to a multitude of words modified by the PMCAS are persisted correctly. Our algorithm leverages hardware transactional memory (HTM) for concurrency control, and has a total of 3 persist barriers in its critical path. We also overview variants based on just the compare-and-swap (CAS) instruction and a hybrid of CAS and HTM.


Published in:
Podc'18: Proceedings Of The 2018 Acm Symposium On Principles Of Distributed Computing, 37-39
Presented at:
37th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), Egham, ENGLAND, Jul 23-27, 2018
Year:
Jan 01 2018
Publisher:
New York, ASSOC COMPUTING MACHINERY
ISBN:
978-1-4503-5795-1
Laboratories:




 Record created 2019-06-18, last modified 2020-10-25


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)