Linux内核伙伴系统分析  

Buddy System Analysis in Linux Kernel

作　　者：薛峰 

机构地区：[1]安徽师范大学数学计算机科学学院,芜湖241002

出　　处：《计算机系统应用》2018年第1期174-179,共6页Computer Systems & Applications

摘　　要：本文针对Linux内核实现的伙伴系统进行了抽象分析,并通过实例演示了算法的执行过程.分析了用于物理地址空间管理的三级数据结构及其关系.在此基础上,详细描述了用于分配和回收页框的伙伴算法.对于待回收的内存块而言,计算其伙伴的索引及合并内存块的索引是回收操作的关键,讨论了相关计算方法的几条结论并予以证明.The buddy system implemented in the Linux kernel is studied, and the process of buddy algorithm is demonstrated with examples. There are three levels of data structure dedicated to manage page frames in physical address space. Firstly, these data structures and their relationships are presented. Then, the buddy algorithm used to allocate and deallocate page frames is described in detail. As far as a memory block to be deallocated is concerned, how to calculate the index of its buddy and coalesced memory block is the key point of deallocating operation. Several conclusions pertaining to this calculation are dealt with and proved.

关 键 词：LINUX内核 内存管理 伙伴算法 伙伴系统 

分 类 号：TP316.81[自动化与计算机技术—计算机软件与理论]