一种面向智能芯片的快速存储管理算法  

A Fast Storage Management Algorithm for Intelligent Chips

作　　者：张宝军[1,2] 潘瑞芳[1,2] 

机构地区：[1]浙江传媒学院新媒体学院,杭州310018 [2]浙江省协同创新中心媒体传播优化协同创新中心,杭州310018

出　　处：《计算机工程》2016年第10期101-106,112,共7页Computer Engineering

基　　金：浙江省重点科技创新团队基金资助项目(2011R50019);国家新闻出版广电总局科研基金资助项目(2014-42)

摘　　要：为有效管理智能芯片的存储资源,提高存储空间的利用率,提出一种具有高存储空间利用率的存储管理算法。该算法将整个存储空间划分为大小相同的存储单元,采用存储块数组和自由块数组进行管理。存储块由多个连续的存储单元组成,分为占用块和空闲块,存储块数组用来记录存储块的信息,包括存储块的占用情况和大小。利用数组下标将大小相同的空闲块组织成多个双向链表,方便存储块的管理。空闲块链表的头存储在自由块数组与空闲块大小对应的下标的元素中,根据要分配的空闲块大小在自由块数组中快速找到空闲块链表的头,实现存储的快速分配。实验结果表明,该算法实现了存储块的分配、释放和合并的功能,存储空间的利用率高,在整体性能上优于伙伴算法。In order to effectively manage storage resources of the intelligent chip and improve the utilization rate of storage space,a storage management algorithm which has fast processing and high storage utilization is proposed. The algorithm divides the whole storage space into multiple units with the same size, and uses block array and free array to manage them. The block contains multiple continuous units. There are two kinds of blocks, the occupied block and the free block. The block array records the information of blocks, such as it is occupied or not and the size of it. The algorithm uses the subscript of block array to organize the free blocks into multiple double direction link tables, which makes the management of blocks easy. The head of free block link table is stored in the free array where the subscript of array is the same as the size of the free block. According to the size of the storage required, the free block with the size can be find quickly in the free array. Experimental results show the proposed realizes the function of storage allocating, releasing and merging, so it has high storage utilization, and the overall performance of the proposed algorithm is better than that of the buddy algorithm.

关 键 词：存储管理算法 伙伴算法 内部碎片 外部碎片 存储单元 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]