{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:09:34Z","timestamp":1750219774987,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,6]],"date-time":"2023-06-06T00:00:00Z","timestamp":1686009600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["101021274"],"award-info":[{"award-number":["101021274"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013209","name":"Hellenic Foundation for Research and Innovation","doi-asserted-by":"publisher","award":["61\/512200"],"award-info":[{"award-number":["61\/512200"]}],"id":[{"id":"10.13039\/501100013209","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,6]]},"DOI":"10.1145\/3591195.3595279","type":"proceedings-article","created":{"date-parts":[[2023,6,6]],"date-time":"2023-06-06T20:32:43Z","timestamp":1686083563000},"page":"58-70","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["The Unexpected Efficiency of Bin Packing Algorithms for Dynamic Storage Allocation in the Wild: An Intellectual Abstract"],"prefix":"10.1145","author":[{"given":"Christos Panagiotis","family":"Lamprakos","sequence":"first","affiliation":[{"name":"National Technical University of Athens, Greece \/ KU Leuven, Belgium"}]},{"given":"Sotirios","family":"Xydis","sequence":"additional","affiliation":[{"name":"National Technical University of Athens, Greece"}]},{"given":"Francky","family":"Catthoor","sequence":"additional","affiliation":[{"name":"IMEC, Belgium \/ KU Leuven, Belgium"}]},{"given":"Dimitrios","family":"Soudris","sequence":"additional","affiliation":[{"name":"National Technical University of Athens, Greece"}]}],"member":"320","published-online":{"date-parts":[[2023,6,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/583854.582421"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780624"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/1988220404871"},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the BSDCan Conference","author":"Evans Jason","year":"2006","unstructured":"Jason Evans . 2006 . A scalable concurrent malloc (3) implementation for FreeBSD . In Proceedings of the BSDCan Conference , Ottawa, Canada. Jason Evans. 2006. A scalable concurrent malloc (3) implementation for FreeBSD. In Proceedings of the BSDCan Conference, Ottawa, Canada."},{"key":"e_1_3_2_1_5_1","volume-title":"Johnson","author":"Garey Michael","year":"1979","unstructured":"Michael Garey and David S . Johnson . 1979 . Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company . Michael Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/286860.286864"},{"key":"e_1_3_2_1_7_1","unstructured":"Jukka Jyl\u00e4nki. 2010. A thousand ways to pack the bin-a practical approach to two-dimensional rectangle bin packing. retrived from http:\/\/clb.demon.fi\/files\/RectangleBinPack.pdf. \t\t\t\t  Jukka Jyl\u00e4nki. 2010. A thousand ways to pack the bin-a practical approach to two-dimensional rectangle bin packing. retrived from http:\/\/clb.demon.fi\/files\/RectangleBinPack.pdf."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(91)90011-P"},{"key":"e_1_3_2_1_9_1","unstructured":"Christos P. Lamprakos Sotirios Xydis Francky Catthoor and Dimitrios Soudris. 2023. Viewing Allocators as Bin Packing Solvers Demystifies Fragmentation. arxiv:2304.10862. \t\t\t\t  Christos P. Lamprakos Sotirios Xydis Francky Catthoor and Dimitrios Soudris. 2023. Viewing Allocators as Bin Packing Solvers Demystifies Fragmentation. arxiv:2304.10862."},{"key":"e_1_3_2_1_10_1","volume-title":"Mimalloc: Free List Sharding in Action","author":"Leijen Daan","year":"2019","unstructured":"Daan Leijen , Benjamin Zorn , and Leonardo de Moura . 2019 . Mimalloc: Free List Sharding in Action . In Programming Languages and Systems, Anthony Widjaja Lin (Ed.). Springer International Publishing , Cham . 244\u2013265. isbn:978-3-030-34175-6 Daan Leijen, Benjamin Zorn, and Leonardo de Moura. 2019. Mimalloc: Free List Sharding in Action. In Programming Languages and Systems, Anthony Widjaja Lin (Ed.). Springer International Publishing, Cham. 244\u2013265. isbn:978-3-030-34175-6"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3315573.3329980"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3373376.3378525"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3567955.3567961"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459898.3463905"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314582"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/321650.321658"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/321832.321846"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/20.3.242"},{"volume-title":"Dynamic storage allocation: A survey and critical review","author":"Wilson Paul R.","key":"e_1_3_2_1_19_1","unstructured":"Paul R. Wilson , Mark S. Johnstone , Michael Neely , and David Boles . 1995. Dynamic storage allocation: A survey and critical review . In Memory Management, Henry G. Baler (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg . 1\u2013116. isbn:978-3-540-45511-0 Paul R. Wilson, Mark S. Johnstone, Michael Neely, and David Boles. 1995. Dynamic storage allocation: A survey and critical review. In Memory Management, Henry G. Baler (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg. 1\u2013116. isbn:978-3-540-45511-0"}],"event":{"name":"ISMM '23: 2023 ACM SIGPLAN International Symposium on Memory Management","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Orlando FL USA","acronym":"ISMM '23"},"container-title":["Proceedings of the 2023 ACM SIGPLAN International Symposium on Memory Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3591195.3595279","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3591195.3595279","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:31Z","timestamp":1750178251000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3591195.3595279"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,6]]},"references-count":19,"alternative-id":["10.1145\/3591195.3595279","10.1145\/3591195"],"URL":"https:\/\/doi.org\/10.1145\/3591195.3595279","relation":{},"subject":[],"published":{"date-parts":[[2023,6,6]]},"assertion":[{"value":"2023-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}