arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2303.05919cs.PFcs.ARcs.LG
收藏

存储管理中的eBPF-based工作集大小估计

eBPF-based Working Set Size Estimation in Memory Management

Sun Yat-sen University(中山大学)

Zhilu Lian, Yangzi Li, Zhixiang Chen, Shiwen Shan, Baoxin Han, Yuxin Su

摘要:

工作集大小估计对于提高现代操作系统的程序执行效率和内存分配效率具有重要意义。以往的工作提出了几种估计WSS的方法,包括自气球、Zballoning等,但是这些方法都是基于虚拟机的,通常会造成很大的开销。因此,使用这些方法来估计WSS是不切实际的。在本文中,我们提出了一个新的框架,有效地估计WSS与eBPF(扩展伯克利包过滤器),一个尖端的技术,通过被附加到内核的监视和过滤数据。通过将eBPF程序固定在内核中,我们可以得到页面错误的次数和其他内存分配信息。此外,我们通过香草工具收集WSS来训练预测模型,以使用LightGBM完成估计工作,LightGBM是一种有用的工具,在连续值上生成决策树。实验结果表明,与传统方法相比,该框架能够准确地估计WSS,开销减少了98.5%.

英文摘要:

Working set size estimation (WSS) is of great significance to improve the efficiency of program executing and memory arrangement in modern operating systems. Previous work proposed several methods to estimate WSS, including self-balloning, Zballoning and so on. However, these methods which are based on virtual machine usually cause a large overhead. Thus, using those methods to estimate WSS is impractical. In this paper, we propose a novel framework to efficiently estimate WSS with eBPF (extended Berkeley Packet Filter), a cutting-edge technology which monitors and filters data by being attached to the kernel. With an eBPF program pinned into the kernel, we get the times of page fault and other information of memory allocation. Moreover, we collect WSS via vanilla tool to train a predictive model to complete estimation work with LightGBM, a useful tool which performs well on generating decision trees over continuous value. The experimental results illustrate that our framework can estimate WSS precisely with 98.5\% reduction in overhead compared to traditional methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑