| 使用矩阵实现LRU的页面置换算法 |
| |
| 引用本文： | 杜雅丽. 使用矩阵实现LRU的页面置换算法[J]. 物联网技术, 2012, 0(8): 53-54 |
| |
| 作者姓名： | 杜雅丽 |
| |
| 作者单位： | 陇东学院信息工程学院 |
| |
| 摘 要： | 操作系统的内存管理一直是计算机领域研究的一个重要方向。文中分析了几种常用内存管理中的页面置换算法及其存在的问题,提出了LUR页面置换算法的操作系统内存管理中比较接近理想算法的一种页面置换算法,并阐述了使用矩阵方法实现该页面置换算法的原理。
|
| 关 键 词： | 页面置换 LRU 矩阵 内存管理 |
Realization of LRU page-replacement algorithm using matrix |
| |
| DU Ya-li. Realization of LRU page-replacement algorithm using matrix[J]. Internet of things technologies, 2012, 0(8): 53-54 |
| |
| Authors: | DU Ya-li |
| |
| Affiliation: | DU Ya-li(College of Information Engineering,Longdong University,Qingyang 745000,China) |
| |
| Abstract: | 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 advantagesdisadvantages 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. |
| |
| Keywords: | page replacement LRU matrix memory management |
| 本文献已被 CNKI 等数据库收录！ |
|
