DiskSeen预取算法的分析及优化研究
发布时间：2018-09-04 08:35
【摘要】：计算机存储层次结构是一种典型的金字塔形结构,以平衡计算机对存储系统的两方面需求,即高速处理数据和大的存储容量。然而随着信息技术的飞速发展,计算机处理器和磁盘之间的速度鸿沟持续扩大,因而磁盘访问便成为一个影响计算机系统性能的瓶颈问题。近几十年来,如何减小磁盘访问延迟对整个计算机系统性能的影响,一直是存储领域的热点研究问题。预取技术,通过提前预测I/O请求并将数据读入缓存中,以对上层应用程序隐藏I/O延迟,是缓解这一瓶颈问题的重要技术手段。DiskSeen是一种块级预取算法,通过分析磁盘块的位置和访问时间的联系来提高磁盘访问的顺序性和总体的预取性能。针对DiskSeen算法,文中主要做了以下几方面工作:首先,分析DiskSeen算法的不足之处,据此提出动态控制预取粒度和二次匹配激活历史预取方法,以优化效率;然后,实现了DiskSeen算法及改进后的算法;最后,在模拟仿真实验环境下对算法进行了性能对比测试。实验结果显示,DiskSeen算法能够明显提高缓存命中率并减少平均响应时间,而优化后的DiskSeen算法则可以进一步提升上述两方面的系统性能。
[Abstract]:Computer storage hierarchy is a typical pyramid structure to balance two aspects of computer storage system requirements: high-speed data processing and large storage capacity. However, with the rapid development of information technology, the speed gap between computer processor and disk continues to widen, so disk access becomes an impact. In recent decades, how to reduce the impact of disk access latency on the performance of the entire computer system has been a hot research topic in the storage field. Prefetching technology, by predicting I/O requests in advance and reading data into the cache to hide I/O latency from the upper application, alleviates this bottleneck problem. DiskSeen is a block-level prefetching algorithm to improve the order of disk access and the overall prefetching performance by analyzing the relationship between the location of disk blocks and the access time. The prefetch granularity and the secondary matching activation history prefetching method are designed to optimize the efficiency; then, the DiskSeen algorithm and the improved algorithm are implemented; finally, the performance of the algorithm is tested in the simulation environment. The experimental results show that the DiskSeen algorithm can significantly improve the cache hit rate and reduce the average response time, and is superior. The modified DiskSeen algorithm can further enhance the performance of the above two aspects.
【作者单位】： 华中科技大学武汉光电国家实验室;
【分类号】：TP333
本文编号：2221566
[Abstract]:Computer storage hierarchy is a typical pyramid structure to balance two aspects of computer storage system requirements: high-speed data processing and large storage capacity. However, with the rapid development of information technology, the speed gap between computer processor and disk continues to widen, so disk access becomes an impact. In recent decades, how to reduce the impact of disk access latency on the performance of the entire computer system has been a hot research topic in the storage field. Prefetching technology, by predicting I/O requests in advance and reading data into the cache to hide I/O latency from the upper application, alleviates this bottleneck problem. DiskSeen is a block-level prefetching algorithm to improve the order of disk access and the overall prefetching performance by analyzing the relationship between the location of disk blocks and the access time. The prefetch granularity and the secondary matching activation history prefetching method are designed to optimize the efficiency; then, the DiskSeen algorithm and the improved algorithm are implemented; finally, the performance of the algorithm is tested in the simulation environment. The experimental results show that the DiskSeen algorithm can significantly improve the cache hit rate and reduce the average response time, and is superior. The modified DiskSeen algorithm can further enhance the performance of the above two aspects.
【作者单位】： 华中科技大学武汉光电国家实验室;
【分类号】：TP333
【相似文献】
相关期刊论文 前1条
1 刘立;陈明宇;包云岗;许建卫;樊建平;;一种基于页面级流缓存结构的流检测和预取算法[J];计算机研究与发展;2009年10期
，本文编号：2221566
本文链接：https://www.wllwen.com/kejilunwen/jisuanjikexuelunwen/2221566.html
