Optimal Disk Scheduling Based On Ant Colony Optimization Algorithm

Disk scheduling problem has theoretical interest and practical importance since, the processor speed and memory capacity have been progressing several times faster than disk speed. More efficient disk usage methods have been needed because of the slow evolution in disk speed technology. Although disk and memory capacity increment is much higher versus disk speed improvement, little studies have been made to develop disk usage algorithms in more efficient manner. In this work, a new approach based on ant colony algorithm is proposed for disk scheduling problem and its performance is evaluated.

[1]  Yale N. Patt,et al.  Scheduling algorithms for modern disk drives , 1994, SIGMETRICS 1994.

[2]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[3]  Zhigang Chen,et al.  Disk Scheduling with Dynamic Request , 1995 .

[4]  Margo I. Seltzer,et al.  Disk Scheduling Revisited , 1990 .

[5]  Chin-Laung Lei,et al.  Competitive Analysis of On-Line Disk Scheduling , 1998, Theory of Computing Systems.

[6]  Kartik Gopalan,et al.  Real-Time Disk Scheduling Using Deadline Sensitive SCAN , 2001 .

[7]  Bernd Scheuermann,et al.  Population based ant colony optimization on FPGA , 2002, 2002 IEEE International Conference on Field-Programmable Technology, 2002. (FPT). Proceedings..

[8]  Walid G. Aref,et al.  Scalable QoS-aware disk-scheduling , 2002, Proceedings International Database Engineering and Applications Symposium.

[9]  John Wilkes,et al.  An introduction to disk drive modeling , 1994, Computer.

[10]  Reiner W. Hartenstein.  Trends in reconfigurable logic and reconfigurable computing , 2002, 9th International Conference on Electronics, Circuits and Systems.

[11]  Michael A. Bender,et al.  New algorithms for the disk scheduling problem , 1996, Proceedings of 37th Conference on Foundations of Computer Science.