一种高效动态存储管理方案  

A High-Performance Dynamic Memory Management Scheme

作　　者：薛立功[1] 周祖德[1] 李方敏[1] 

机构地区：[1]武汉理工大学信息工程学院,湖北武汉430070

出　　处：《武汉理工大学学报（信息与管理工程版）》2006年第11期92-95,共4页Journal of Wuhan University of Technology：Information & Management Engineering

基　　金：湖北省数字制造重点实验室开放基金资助项目(SZ0411)

摘　　要：动态存储管理是许多软件系统统重要组成部分。在理论研究和实际应用中,按地址有序首次匹配线性表结构的DMM由于其有利于增强程序局部性,显著地减少内存碎片,因而得到广泛的关注。给出了适用于按地址有序首次匹配DMM的一种基于CACHE的动态存储管理方案,该方案通过缓存最近释放的内存块,可以显著提高DMM,尤其是内存释放的效率。理论分析和实际评估结果证明了方案的有效性。Dynamic memory management takes an important count in most programs. Compared with other DMMs, first fit DMM using address - ordered linear list data structure is the most researched and applied, since it tends to enhance program locality, and causes significantly less fragmentation. An efficient scheme suitable for this kind of DMM is proposed which can evidently improve the DMM efficiency, especially memory - releasing efficiency,by caching recently freed blocks. This improvement is testified by theoretical analysis and cvaluation result.

关 键 词：动态存储管理 CACHE 地址有序 首次匹配 

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