网络磁盘阵列中基于任务排队的多用户请求动态调度策略  

Queue-based Dynamic Schedule Algorithm for Multi-user Request in Network-attached Disk Array

作　　者：李洁琼[1] 冯丹[1] 

机构地区：[1]华中科技大学计算机学院,武汉430074

出　　处：《计算机科学》2009年第4期87-89,共3页Computer Science

基　　金：国家九七三重点基础研究发展规划项目基金(2004CB318300);国家自然科学基金(60303032)资助

摘　　要：在存储系统中,底层I/O调度策略十分重要,它决定了整个存储系统的效率。一个良好的调度策略可以有效地提高系统的性能。结合网络磁盘阵列的工作特点,提出了一种基于任务排队的动态调度算法,其基本思想是充分利用多个网络用户的请求数据在网络磁盘阵列上的空间连续性,最大限度地减小磁头寻道延迟和旋转延迟,从而降低系统的响应时间。In the storage system, the bottom layer I/O schedule strategy is very important which decides the efficiency of the system. A good schedule policy could improve system performance obviously. This paper proposed an innovational solution that traces net users＇ requests and queues them according to their logical addresses based on the characteristics of network attached disk array. Theoretical analysis and test results show that the policy makes the access arm of the disks move regularly,decreases the disk＇s I/O time maximally, and reduces the average I/O response time of the system.

关 键 词：网络磁盘阵列 动态调度算法 I/O响应时间 

分 类 号：TP241.2[自动化与计算机技术—检测技术与自动化装置] TP333.35[自动化与计算机技术—控制科学与工程]