{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:09:17Z","timestamp":1763467757934,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,6,10]],"date-time":"2006-06-10T00:00:00Z","timestamp":1149897600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,6,10]]},"DOI":"10.1145\/1133956.1133967","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"74-83","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":59,"title":["McRT-Malloc"],"prefix":"10.1145","author":[{"given":"Richard L.","family":"Hudson","sequence":"first","affiliation":[{"name":"Intel Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bratin","family":"Saha","sequence":"additional","affiliation":[{"name":"Intel Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali-Reza","family":"Adl-Tabatabai","sequence":"additional","affiliation":[{"name":"Intel Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin C.","family":"Hertzberg","sequence":"additional","affiliation":[{"name":"Stanford University, Palo Alto, California"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,6,10]]},"reference":[{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/378993.379232"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1103845.1094852"},{"key":"e_1_3_2_1_6_1","unstructured":"Gray J. and Reuter A. Transaction processing: concepts and techniques.   Gray J. and Reuter A. Transaction processing: concepts and techniques."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/949305.949340"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065944.1065952"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the 16th international Conference on Distributed Computing (October28 - 30","volume":"2508","author":"Herlihy M.","year":"2002","unstructured":"Herlihy , M. , Luchangco , V. , and Moir , M . 2002. The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures . In Proceedings of the 16th international Conference on Distributed Computing (October28 - 30 , 2002 ). D. Malkhi, Ed. Lecture Notes In Computer Science , vol. 2508 . Springer-Verlag, London, 339--353. Herlihy, M., Luchangco, V., and Moir, M. 2002. The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures. In Proceedings of the 16th international Conference on Distributed Computing (October28 - 30, 2002). D. Malkhi, Ed. Lecture Notes In Computer Science, vol. 2508. Springer-Verlag, London, 339--353."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/996841.996848"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/286860.286864"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2005.54"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2005.31"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066650.1066660"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571829"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1122971.1123001"}],"event":{"name":"ISMM06: The 2006 International Symposium on Memory Management","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"],"location":"Ottawa Ontario Canada","acronym":"ISMM06"},"container-title":["Proceedings of the 5th international symposium on Memory management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1133956.1133967","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1133956.1133967","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:18Z","timestamp":1750278138000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1133956.1133967"}},"subtitle":["a scalable transactional memory allocator"],"short-title":[],"issued":{"date-parts":[[2006,6,10]]},"references-count":13,"alternative-id":["10.1145\/1133956.1133967","10.1145\/1133956"],"URL":"https:\/\/doi.org\/10.1145\/1133956.1133967","relation":{},"subject":[],"published":{"date-parts":[[2006,6,10]]},"assertion":[{"value":"2006-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}