The Unexpected Efficiency of Bin Packing Algorithms for Dynamic Storage Allocation in the Wild: An Intellectual Abstract-Reference-Cited by-同舟云学术

The Unexpected Efficiency of Bin Packing Algorithms for Dynamic Storage Allocation in the Wild: An Intellectual Abstract

Published:2023-06-06 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2023 ACM SIGPLAN International Symposium on Memory Management
language:
Short-container-title:

Author:

Lamprakos Christos Panagiotis¹,Xydis Sotirios²,Catthoor Francky³,Soudris Dimitrios²

Affiliation:

1. National Technical University of Athens, Greece / KU Leuven, Belgium

2. National Technical University of Athens, Greece

3. IMEC, Belgium / KU Leuven, Belgium

Funder

H2020 European Research Council

Hellenic Foundation for Research and Innovation

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3591195.3595279

Reference19 articles.

1. Reconsidering custom memory allocation

2. OPT versus LOAD in dynamic storage allocation

3. On some packing problem related to dynamic storage allocation

4. 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.

5. 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.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Beyond RSS: Towards Intelligent Dynamic Memory Management (Work in Progress);Proceedings of the 20th ACM SIGPLAN International Conference on Managed Programming Languages and Runtimes;2023-10-19