The Unexpected Efficiency of Bin Packing Algorithms for Dynamic Storage Allocation - ISMM 2023
ACM SIGPLAN via YouTube
Google Data Analytics, IBM AI & Meta Marketing — All in One Subscription
Build the Finance Skills That Lead to Promotions — Not Just Certificates
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore a 19-minute video presentation from the ISMM 2023 conference that delves into the unexpected efficiency of bin packing algorithms for dynamic storage allocation. Discover how two-dimensional rectangular bin packing (2DBP) can be applied to optimize memory allocation in embedded systems. Learn about the comparison between allocator-generated placements and makespan-optimizing 2DBP algorithms, and gain insights into the surprising performance of GNU's malloc implementation. Examine the potential of 2DBP algorithms in reducing memory fragmentation and their implications for future memory-targeting optimizations. Gain valuable knowledge on the relationship between theoretical algorithms and practical memory allocation strategies in modern computing systems.
Syllabus
[ISMM'23] The Unexpected Efficiency of Bin Packing Algorithms for Dynamic Storage Allocation in(…)
Taught by
ACM SIGPLAN