{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T17:00:11Z","timestamp":1759683611799,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,6,13]],"date-time":"2008-06-13T00:00:00Z","timestamp":1213315200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["CCR-0205544CCR-0509356IIS-0133686"],"award-info":[{"award-number":["CCR-0205544CCR-0509356IIS-0133686"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCR-0205544CCR-0509356IIS-0133686"],"award-info":[{"award-number":["CCR-0205544CCR-0509356IIS-0133686"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,6,13]]},"DOI":"10.1145\/1457150.1457157","type":"proceedings-article","created":{"date-parts":[[2008,11,6]],"date-time":"2008-11-06T13:49:50Z","timestamp":1225979390000},"page":"35-40","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Critical sections"],"prefix":"10.1145","author":[{"given":"Ryan","family":"Johnson","sequence":"first","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ippokratis","family":"Pandis","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anastasia","family":"Ailamaki","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University and \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/32204.32220"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.80120"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/850657.850659"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191915"},{"key":"e_1_3_2_1_5_1","volume-title":"Dept. of Computer Science","author":"Craig T.","year":"1993","unstructured":"T. Craig . \"Building FIFO and priority-queueing spin locks from atomic swap.\" Technical Report TR 93-02-02, University of Washington , Dept. of Computer Science , 1993 . T. Craig. \"Building FIFO and priority-queueing spin locks from atomic swap.\" Technical Report TR 93-02-02, University of Washington, Dept. of Computer Science, 1993."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011776"},{"key":"e_1_3_2_1_7_1","volume-title":"VLDB","author":"Gottemukkala V.","year":"1992","unstructured":"V. Gottemukkala , and T. J. Lehman . \" Locking and latching in a memory-resident database system.\" In Proc . VLDB , 1992 . V. Gottemukkala, and T. J. Lehman. \"Locking and latching in a memory-resident database system.\" In Proc. VLDB, 1992."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11602569_6"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/114005.102808"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/165123.165164"},{"key":"e_1_3_2_1_11_1","unstructured":"R. Johnson I. Pandis N. Hardavellas and A. Ailamaki. \"Shore-MT: A Quest for Scalability in the Many-Core Era.\" CMU-CS-08-114.  R. Johnson I. Pandis N. Hardavellas and A. Ailamaki. \"Shore-MT: A Quest for Scalability in the Many-Core Era.\" CMU-CS-08-114."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2005.35"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.1993.21"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/564870.564881"},{"key":"e_1_3_2_1_15_1","volume-title":"IPPS","author":"Magnussen P.","year":"1994","unstructured":"P. Magnussen , A. Landin , and E. Hagersten . \" Queue locks on cache coherent multiprocessors.\" In Proc . IPPS , 1994 . P. Magnussen, A. Landin, and E. Hagersten. \"Queue locks on cache coherent multiprocessors.\" In Proc. IPPS, 1994."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/103727.103729"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/109625.109637"},{"key":"e_1_3_2_1_18_1","volume-title":"Speculative lock elision: enabling highly concurrent multithreaded execution.\" IEEE MICRO","author":"Rajwar R.","year":"2001","unstructured":"R. Rajwar , and J. Goodman . \" Speculative lock elision: enabling highly concurrent multithreaded execution.\" IEEE MICRO , 2001 . R. Rajwar, and J. Goodman. \"Speculative lock elision: enabling highly concurrent multithreaded execution.\" IEEE MICRO, 2001."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/605397.605399"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/359060.359076"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/318898.318910"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/800015.808203"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/224964.224987"}],"event":{"name":"DaMoN '08: Data Management on New Hardware","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","Microsoft Microsoft","Intel Intel","IBM IBM"],"location":"Vancouver Canada","acronym":"DaMoN '08"},"container-title":["Proceedings of the 4th international workshop on Data management on new hardware"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1457150.1457157","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1457150.1457157","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:45:48Z","timestamp":1750250748000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1457150.1457157"}},"subtitle":["re-emerging scalability concerns for database storage engines"],"short-title":[],"issued":{"date-parts":[[2008,6,13]]},"references-count":23,"alternative-id":["10.1145\/1457150.1457157","10.1145\/1457150"],"URL":"https:\/\/doi.org\/10.1145\/1457150.1457157","relation":{},"subject":[],"published":{"date-parts":[[2008,6,13]]},"assertion":[{"value":"2008-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}