  Audio, animations and video belong to a class of data known as delay
sensitive because they are sensitive to delays in presentation to the users.
Also, because of huge data in such items, disk is an important device in
managing them. In order to have an acceptable presentation, disk requests
deadlines must be met, and a real-time scheduling approach should be used to
guarantee the timing requirements for such environment. However, some disk
scheduling algorithms have been proposed since now to optimize scheduling
real-time disk requests, but improving the results is a challenge yet. In this
paper, we propose a new disk scheduling method based on Ant Colony Optimization
(ACO) approach. In this approach, ACO models the tasks and finds the best
sequence to minimize number of missed tasks and maximize throughput.
Experimental results showed that the proposed method worked very well and
excelled other related ones in terms of miss ratio and throughput in most
cases.
