摘要：iSCSI storage system is the most widely used network storage system, and soft real-time services are the most common type of business. However, the traditional I/O scheduling algorithms can't work very well for iSCSI storage system oriented soft real-time services. In this paper, the mathematical model of I/O scheduling in iSCSI storage system for soft real-time services is analyzed and discussed, and it proves that this is a multi-objective optimization problem. HB-SCHED is proposed in this paper, which is a heuristic I/O scheduling algorithm for soft real-time services oriented iSCSI storage system. The simulation results show that HB-SCHED not only has better quality in terms of real time than SCAN and can gain higher disk throughput than EDF, but also can adjust the weights between real time and disk throughput by changing the parameter value. HB-SCHED can be well adopted in soft real-time services oriented iSCSI storage system.
