首页 | 本学科首页   官方微博 | 高级检索  
     

Linux2.6预测I/O调度程序研究
引用本文:曹健辉,陈亚骏. Linux2.6预测I/O调度程序研究[J]. 信息安全与通信保密, 2009, 0(2): 85-87
作者姓名:曹健辉  陈亚骏
作者单位:上海交通,大学信息安全学院,上海,200240
摘    要:硬盘寻址是操作系统中最慢的操作之一,对硬盘的访问性能直接影响着操作系统的总体性能,因此对提交给硬盘的I/O请求进行公平高效的调度成为操作系统里必不可少的功能部分。Linux2.6内核里的预测I/O调度程序利用读预测机制减少了硬盘寻址操作,从而保证了很高的全局吞吐量,同时还通过引入防止饥饿的请求分派机制保证了请求之间的公平性。

关 键 词:I/O调度  硬盘寻址  请求分派  读预测

Analysis of Anticipatory I/O Scheduler in Linux2.6
CAO Jian-hui,CHEN Ya-jun. Analysis of Anticipatory I/O Scheduler in Linux2.6[J]. China Information Security, 2009, 0(2): 85-87
Authors:CAO Jian-hui  CHEN Ya-jun
Affiliation:(Information Security Department of Shanghai JiaoTong University, Shanghai Jiaotong University, Shanghai 200240, China)
Abstract:Disk Seeking is one of the slowest operations in the operating system and the performance of access to disk directly affects the overall performance of the system. So it is an essential functional part of the operating system to schedule the I/O requests fairly and efficiently. The anticipatory I/O scheduler introduced in Linux2.6, which makes use of read anticipation to reduce disk seeking operations, can ensure a high system global throughput, while guarantees the fairness by introducing request dispatching mechanism which can avoid request starvation.
Keywords:I/O schedule  disk seeking  request dispatching  read anticipation
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号