{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:30:45Z","timestamp":1750221045512,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,11,26]],"date-time":"2018-11-26T00:00:00Z","timestamp":1543190400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UID\/CEC\/50021\/2013 and PTDC\/EEISCR\/1743\/2014"],"award-info":[{"award-number":["UID\/CEC\/50021\/2013 and PTDC\/EEISCR\/1743\/2014"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,11,26]]},"DOI":"10.1145\/3274808.3274825","type":"proceedings-article","created":{"date-parts":[[2019,2,13]],"date-time":"2019-02-13T18:41:21Z","timestamp":1550083281000},"page":"214-226","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Speculative Read Write Locks"],"prefix":"10.1145","author":[{"given":"Shady","family":"Issa","sequence":"first","affiliation":[{"name":"INESC-ID \/ Instituto Superior T\u00e9cnico, University of Lisbon, Portugal"}]},{"given":"Paolo","family":"Romano","sequence":"additional","affiliation":[{"name":"INESC-ID \/ Instituto Superior T\u00e9cnico, University of Lisbon, Portugal"}]},{"given":"Tiago","family":"Lopes","sequence":"additional","affiliation":[{"name":"INESC-ID \/ Instituto Superior T\u00e9cnico, University of Lisbon, Portugal"}]}],"member":"320","published-online":{"date-parts":[[2018,11,26]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/","author":"Posix","year":"2013","unstructured":"Posix .1--2008. http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/ , 2013 . Posix.1--2008. http:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/, 2013."},{"key":"e_1_3_2_2_2_1","volume-title":"https:\/\/github.com\/shadyalaa\/SpRWL","author":"Sp","year":"2018","unstructured":"Sp RWL open source implementation. https:\/\/github.com\/shadyalaa\/SpRWL , 2018 . SpRWL open source implementation. https:\/\/github.com\/shadyalaa\/SpRWL, 2018."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611471"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/L-CA.2006.18"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ECRTS.2009.14"},{"key":"e_1_3_2_2_6_1","volume-title":"9th ACM SIGPLAN Wkshp. on Transactional Computing","author":"Calciu I.","year":"2014","unstructured":"Calciu , I. , Shpeisman , T. , Pokam , G. , and Herlihy , M . Improved single global lock fallback for best-effort hardware transactional memory . 9th ACM SIGPLAN Wkshp. on Transactional Computing ( 2014 ). Calciu, I., Shpeisman, T., Pokam, G., and Herlihy, M. Improved single global lock fallback for best-effort hardware transactional memory. 9th ACM SIGPLAN Wkshp. on Transactional Computing (2014)."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2150976.2150998"},{"key":"e_1_3_2_2_8_1","volume-title":"Big reader locks. https:\/\/lwn.net\/Articles\/378911\/","author":"Corbet J.","year":"2016","unstructured":"Corbet , J. Big reader locks. https:\/\/lwn.net\/Articles\/378911\/ , 2016 . Corbet, J. Big reader locks. https:\/\/lwn.net\/Articles\/378911\/, 2016."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/362759.362813"},{"key":"e_1_3_2_2_10_1","volume-title":"Hardware extensions to make lazy subscription safe. CoRR abs\/1407.6968","author":"Dice D.","year":"2014","unstructured":"Dice , D. , Harris , T. L. , Kogan , A. , Lev , Y. , and Moir , M . Hardware extensions to make lazy subscription safe. CoRR abs\/1407.6968 ( 2014 ). Dice, D., Harris, T. L., Kogan, A., Lev, Y., and Moir, M. Hardware extensions to make lazy subscription safe. CoRR abs\/1407.6968 (2014)."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612696"},{"key":"e_1_3_2_2_12_1","first-page":"209","volume-title":"11th International Conference on Autonomic Computing (ICAC 14)","author":"Diegues N.","year":"2014","unstructured":"Diegues , N. , and Romano , P . Self-tuning Intel transactional synchronization extensions . In 11th International Conference on Autonomic Computing (ICAC 14) (Philadelphia, PA, June 2014 ), USENIX Association , pp. 209 -- 219 . Diegues, N., and Romano, P. Self-tuning Intel transactional synchronization extensions. In 11th International Conference on Autonomic Computing (ICAC 14) (Philadelphia, PA, June 2014), USENIX Association, pp. 209--219."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755578"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2628071.2628080"},{"key":"e_1_3_2_2_15_1","volume-title":"Stand-alone in-memory TPC-C implementation. https:\/\/github.com\/evanj\/tpccbench","author":"Jones","year":"2017","unstructured":"E. Jones . Stand-alone in-memory TPC-C implementation. https:\/\/github.com\/evanj\/tpccbench , 2017 . E.Jones. Stand-alone in-memory TPC-C implementation. https:\/\/github.com\/evanj\/tpccbench, 2017."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281106"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2901318.2901346"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.70"},{"key":"e_1_3_2_2_19_1","volume-title":"Proceedings of the OOPSLA 2005 Workshop on Synchronization and Concurrency in Object-Oriented Languages (SCOOL'05)","author":"Guerraoui R.","year":"2005","unstructured":"Guerraoui , R. , Herlihy , M. , Kapalka , M. , and Pochon , B . Robust Contention Management in Software Transactional Memory . In Proceedings of the OOPSLA 2005 Workshop on Synchronization and Concurrency in Object-Oriented Languages (SCOOL'05) ( 2005 ). Guerraoui, R., Herlihy, M., Kapalka, M., and Pochon, B. Robust Contention Management in Software Transactional Memory. In Proceedings of the OOPSLA 2005 Workshop on Synchronization and Concurrency in Object-Oriented Languages (SCOOL'05) (2005)."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561927_23"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073863"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345233"},{"key":"e_1_3_2_2_23_1","series-title":"DISC '17","first-page":"1","volume-title":"LIPIcs 31st International Symposium on Distributed Computing (Dagstuhl","author":"Issa S.","year":"2017","unstructured":"Issa , S. , Felber , P. , Matveev , A. , and Romano , P . Extending Hardware Transactional Memory Capacity via Rollback-Only Transactions and Suspend\/Resume . In LIPIcs 31st International Symposium on Distributed Computing (Dagstuhl , Germany, 2017 ), vol. 91 of DISC '17 , Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik , pp. 28: 1 -- 28 :16. Issa, S., Felber, P., Matveev, A., and Romano, P. Extending Hardware Transactional Memory Capacity via Rollback-Only Transactions and Suspend\/Resume. In LIPIcs 31st International Symposium on Distributed Computing (Dagstuhl, Germany, 2017), vol. 91 of DISC '17, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, pp. 28:1--28:16."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2015.64"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2017.16"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1147\/JRD.2014.2380199"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064015"},{"key":"e_1_3_2_2_28_1","first-page":"219","volume-title":"2014 USENIX Annual Technical Conference (USENIX ATC 14)","author":"Liu R.","year":"2014","unstructured":"Liu , R. , Zhang , H. , and Chen , H . Scalable read-mostly synchronization using passive reader-writer locks . In 2014 USENIX Annual Technical Conference (USENIX ATC 14) (Philadelphia, PA, June 2014 ), USENIX Association , pp. 219 -- 230 . Liu, R., Zhang, H., and Chen, H. Scalable read-mostly synchronization using passive reader-writer locks. In 2014 USENIX Annual Technical Conference (USENIX ATC 14) (Philadelphia, PA, June 2014), USENIX Association, pp. 219--230."},{"key":"e_1_3_2_2_29_1","first-page":"509","volume-title":"NV","author":"McKenney P. E.","year":"1998","unstructured":"McKenney , P. E. , and Slingwine , J. D . Read-Copy Update: Using Execution History to Solve Concurrency Problems. In Parallel and Distributed Computing and Systems (Las Vegas , NV , Oct. 1998 ), pp. 509 -- 518 . McKenney, P. E., and Slingwine, J. D. Read-Copy Update: Using Execution History to Solve Concurrency Problems. In Parallel and Distributed Computing and Systems (Las Vegas, NV, Oct. 1998), pp. 509--518."},{"key":"e_1_3_2_2_30_1","volume-title":"What is RCU, fundamentally? https:\/\/lwn.net\/Articles\/262464\/","author":"McKenney P. E.","year":"2007","unstructured":"McKenney , P. E. , and Walpole , J . What is RCU, fundamentally? https:\/\/lwn.net\/Articles\/262464\/ , 2007 . McKenney, P. E., and Walpole, J. What is RCU, fundamentally? https:\/\/lwn.net\/Articles\/262464\/, 2007."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/109625.109637"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2749469.2750403"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/563998.564036"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073861"},{"key":"e_1_3_2_2_35_1","first-page":"1150","volume-title":"Proceedings of the 33rd International Conference on Very Large Data Bases (2007), VLDB '07, VLDB Endowment","author":"Stonebraker M.","unstructured":"Stonebraker , M. , Madden , S. , Abadi , D.J. , Harizopoulos , S. , Hachem , N. , and Helland , P . The end of an architectural era: (it's time for a complete rewrite) . In Proceedings of the 33rd International Conference on Very Large Data Bases (2007), VLDB '07, VLDB Endowment , pp. 1150 -- 1160 . Stonebraker, M., Madden, S., Abadi, D.J., Harizopoulos, S., Hachem, N., and Helland, P. The end of an architectural era: (it's time for a complete rewrite). In Proceedings of the 33rd International Conference on Very Large Data Bases (2007), VLDB '07, VLDB Endowment, pp. 1150--1160."},{"key":"e_1_3_2_2_36_1","volume-title":"TPC BENCHMARK\u2122 C. Revision 5.11.","author":"TPC Council","year":"2010","unstructured":"TPC Council . Transaction Processing Performance Council , TPC BENCHMARK\u2122 C. Revision 5.11. February 2010 . TPC Council. Transaction Processing Performance Council, TPC BENCHMARK\u2122 C. Revision 5.11. February 2010."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503232"}],"event":{"name":"Middleware '18: 19th International Middleware Conference","sponsor":["ACM Association for Computing Machinery","USENIX Assoc USENIX Assoc","IFIP International Federation for Information Processing"],"location":"Rennes France","acronym":"Middleware '18"},"container-title":["Proceedings of the 19th International Middleware Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3274808.3274825","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3274808.3274825","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:44:03Z","timestamp":1750207443000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3274808.3274825"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,26]]},"references-count":37,"alternative-id":["10.1145\/3274808.3274825","10.1145\/3274808"],"URL":"https:\/\/doi.org\/10.1145\/3274808.3274825","relation":{},"subject":[],"published":{"date-parts":[[2018,11,26]]},"assertion":[{"value":"2018-11-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}