使用矩阵实现LRU的页面置换算法  

Realization of LRU page-replacement algorithm using matrix

作　　者：杜雅丽[1] 

机构地区：[1]陇东学院信息工程学院,甘肃庆阳745000

出　　处：《物联网技术》2012年第8期53-54,共2页Internet of things technologies

摘　　要：操作系统的内存管理一直是计算机领域研究的一个重要方向。文中分析了几种常用内存管理中的页面置换算法及其存在的问题,提出了LUR页面置换算法的操作系统内存管理中比较接近理想算法的一种页面置换算法,并阐述了使用矩阵方法实现该页面置换算法的原理。Memory management of operating system is a very important research direction in computer science field. In the paper, several widely-used page-replacement algorithms are introduced and their advantages/disadvantages are analyzed. The research indictaes that LRU page-replacement algorithm is very close to the ideal one in memory management of operating system. Based on this, the principle of matrix method, which is used to realize the LRU algorithms, is introduced and discussed in detail.

关 键 词：页面置换 LRU 矩阵 内存管理 

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