面向未来的静态内存规划
Futureproof Static Memory Planning
AI总结:
针对动态存储分配的NP完全优化问题,提出面向百万级缓冲区的低碎片化高性能实现idealloc,在多个领域的困难基准测试中综合有效性与鲁棒性排名第一。
摘要:
为具有已知大小和生命周期的缓冲区集合分配偏移量以最小化总内存使用量的NP完全组合优化任务被称为动态存储分配(DSA)。现有的DSA实现绕过了理论上的最先进算法,转而采用快速但浪费的启发式方法,或采用无法扩展到超过一千个缓冲区的内存高效方法。“AI内存墙”与深度神经网络的静态架构相结合,重新点燃了人们对DSA的兴趣。我们提出了idealloc,这是一种低碎片化、高性能的DSA实现,专为百万级缓冲区实例设计。在一个由多个领域组成的、特别困难的新型基准测试套件上进行评估后,idealloc在联合有效性/鲁棒性标准方面,在四个生产实现中排名第一。
英文摘要:
The NP-complete combinatorial optimization task of assigning offsets to a set of buffers with known sizes and lifetimes so as to minimize total memory usage is called dynamic storage allocation (DSA). Existing DSA implementations bypass the theoretical state-of-the-art algorithms in favor of either fast but wasteful heuristics, or memory-efficient approaches that do not scale beyond one thousand buffers. The "AI memory wall", combined with deep neural networks' static architecture, has reignited interest in DSA. We present idealloc, a low-fragmentation, high-performance DSA implementation designed for million-buffer instances. Evaluated on a novel suite of particularly hard benchmarks from several domains, idealloc ranks first against four production implementations in terms of a joint effectiveness/robustness criterion.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。