江苏大学学报（自然科学版）2011，Vol.32Issue(5)：557-561,596,6.DOI:10.3969/j.issn.1671-7775.2011.05.012
基于周期性和延迟代价的页面调度算法
Page scheduling algorithm based on periodic access and latency cost
摘要
Abstract
Due to the difficulty for existing page scheduling algorithm to further improve system performance by increasing hit rate, a new algorithm was proposed. The information of page access time, location and counts was statistically collected to analyze the time scope of reading latency, and a cache buffer management data structure with a cost bit was designed. Based on periodic access pattern and latency cost, a cache buffer replacement algorithm was proposed with scheduling simulation and practical implementation. The results show that the page access pattern shows periodicity for expanding observing time scale with cross-instruction cycle. By swapping out the pages with high latency cost as later as possible to avoid cost cyclic access, the periodicity plays an important role in page scheduling for shortening the average queue length and waiting time of storage system. The system performance can be improved by the proposed page scheduling algorithm.关键词
体系结构设计/算法/缓存/性能/周期性负载/延迟代价Key words
architectural design/ algorithm/ cache memory/ performance/ cyclic load/ latency cost分类
信息技术与安全科学引用本文复制引用
侯防,赵跃龙,王禹..基于周期性和延迟代价的页面调度算法[J].江苏大学学报（自然科学版）,2011,32(5):557-561,596,6.基金项目
教育部博士点基金资助项目(200805610019) （200805610019）
