{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T01:04:55Z","timestamp":1773277495260,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T00:00:00Z","timestamp":1531267200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Swiss National Science Foundation","award":["200021-178822\/1"],"award-info":[{"award-number":["200021-178822\/1"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,11]]},"DOI":"10.1145\/3210377.3210392","type":"proceedings-article","created":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T17:46:44Z","timestamp":1531417604000},"page":"271-282","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":59,"title":["Romulus"],"prefix":"10.1145","author":[{"given":"Andreia","family":"Correia","sequence":"first","affiliation":[{"name":"University of Neuchatel, Neuchatel, Switzerland"}]},{"given":"Pascal","family":"Felber","sequence":"additional","affiliation":[{"name":"University of Neuchatel, Neuchatel, Switzerland"}]},{"given":"Pedro","family":"Ramalhete","sequence":"additional","affiliation":[{"name":"Cisco Systems, Lausanne, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2749441"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983990.2984019"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517327.2442532"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2714064.2660224"},{"key":"e_1_3_2_1_5_1","volume-title":"NVMOVE: Helping Programmers Move to Byte-Based Persistence.. In INFLOW@ OSDI.","author":"Chauhan Himanshu","year":"2016","unstructured":"Himanshu Chauhan , Irina Calciu , Vijay Chidambaram , Eric Schkufza , Onur Mutlu , and Pratap Subrahmanyam . 2016 . NVMOVE: Helping Programmers Move to Byte-Based Persistence.. In INFLOW@ OSDI. Himanshu Chauhan, Irina Calciu, Vijay Chidambaram, Eric Schkufza, Onur Mutlu, and Pratap Subrahmanyam. 2016. NVMOVE: Helping Programmers Move to Byte-Based Persistence.. In INFLOW@ OSDI."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/3154601.3154606"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1961295.1950380"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133891"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629589"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Andreia Correia Pascal Felber and Pedro Ramalhete. 2018. Romulus github. https:\/\/github.com\/pramalhe\/Romulus. (2018).  Andreia Correia Pascal Felber and Pedro Ramalhete. 2018. Romulus github. https:\/\/github.com\/pramalhe\/Romulus. (2018).","DOI":"10.1145\/3210377.3210392"},{"key":"e_1_3_2_1_11_1","unstructured":"CPP-ISO-committee. 2013. C++ Memory Order. http:\/\/en.cppreference.com\/w\/c\/ atomic\/memory_order. (2013).  CPP-ISO-committee. 2013. C++ Memory Order. http:\/\/en.cppreference.com\/w\/c\/ atomic\/memory_order. (2013)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989502"},{"key":"e_1_3_2_1_13_1","volume-title":"URL: https:\/\/github. com\/- google\/leveldb,% 20http:\/\/leveldb. org","author":"Ghemawat Sanjay","year":"2011","unstructured":"Sanjay Ghemawat and Jeff Dean . 2011. Level DB. URL: https:\/\/github. com\/- google\/leveldb,% 20http:\/\/leveldb. org ( 2011 ). Sanjay Ghemawat and Jeff Dean. 2011. LevelDB. URL: https:\/\/github. com\/- google\/leveldb,% 20http:\/\/leveldb. org (2011)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810540"},{"key":"e_1_3_2_1_15_1","unstructured":"Maurice Herlihy and Nir Shavit. 2011. The art of multiprocessor programming. Morgan Kaufmann.   Maurice Herlihy and Nir Shavit. 2011. The art of multiprocessor programming. Morgan Kaufmann."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872362.2872410"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935810"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53426-7_23"},{"key":"e_1_3_2_1_19_1","unstructured":"Doug Lea and Wolfram Gloger. 1996. A memory allocator. (1996).  Doug Lea and Wolfram Gloger. 1996. A memory allocator. (1996)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/269005.266665"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2015.7208274"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2014.6974684"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3037697.3037730"},{"key":"e_1_3_2_1_24_1","volume-title":"Brief Announcement: Left-Right-A Concurrency Control Technique with Wait-Free Population Oblivious Reads. Distributed","author":"Ramalhete Pedro","year":"2015","unstructured":"Pedro Ramalhete and Andreia Correia . 2015 . Brief Announcement: Left-Right-A Concurrency Control Technique with Wait-Free Population Oblivious Reads. Distributed (2015), 663. Pedro Ramalhete and Andreia Correia. 2015. Brief Announcement: Left-Right-A Concurrency Control Technique with Wait-Free Population Oblivious Reads. Distributed (2015), 663."},{"key":"e_1_3_2_1_25_1","unstructured":"T Riegel P Felber and C Fetzer. 2010. TinySTM. (2010).  T Riegel P Felber and C Fetzer. 2010. TinySTM. (2010)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2803140.2803144"},{"key":"e_1_3_2_1_27_1","unstructured":"Pmem team. 2017. Persistent Memory Programming. http:\/\/pmem.io. (2017).  Pmem team. 2017. Persistent Memory Programming. http:\/\/pmem.io. (2017)."},{"key":"e_1_3_2_1_28_1","unstructured":"Viking Technology. 2017. Persistent Memory Technologies. http:\/\/www. vikingtechnology.com\/products\/nvdimm\/. (2017).  Viking Technology. 2017. Persistent Memory Technologies. http:\/\/www. vikingtechnology.com\/products\/nvdimm\/. (2017)."},{"key":"e_1_3_2_1_29_1","unstructured":"Viking Technology. 2017. Persistent Memory Technologies. http:\/\/www. vikingtechnology.com\/products\/nvdimm\/. (2017).  Viking Technology. 2017. Persistent Memory Technologies. http:\/\/www. vikingtechnology.com\/products\/nvdimm\/. (2017)."},{"key":"e_1_3_2_1_30_1","first-page":"61","article-title":"Consistent and Durable Data Structures for Non-Volatile ByteAddressable Memory","volume":"11","author":"Venkataraman Shivaram","year":"2011","unstructured":"Shivaram Venkataraman , Niraj Tolia , Parthasarathy Ranganathan , Roy H Campbell , 2011 . Consistent and Durable Data Structures for Non-Volatile ByteAddressable Memory .. In FAST , Vol. 11. 61 -- 75 . Shivaram Venkataraman, Niraj Tolia, Parthasarathy Ranganathan, Roy H Campbell, et al. 2011. Consistent and Durable Data Structures for Non-Volatile ByteAddressable Memory.. In FAST, Vol. 11. 61--75.","journal-title":"FAST"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1961295.1950379"}],"event":{"name":"SPAA '18: 30th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Vienna Austria","acronym":"SPAA '18","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"]},"container-title":["Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210392","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3210377.3210392","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:13Z","timestamp":1750208893000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210392"}},"subtitle":["Efficient Algorithms for Persistent Transactional Memory"],"short-title":[],"issued":{"date-parts":[[2018,7,11]]},"references-count":31,"alternative-id":["10.1145\/3210377.3210392","10.1145\/3210377"],"URL":"https:\/\/doi.org\/10.1145\/3210377.3210392","relation":{},"subject":[],"published":{"date-parts":[[2018,7,11]]},"assertion":[{"value":"2018-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}