A TIGHT UPPER BOUND OF THE LUMPED DISK SEEK TIME FOR THE SCAN DISK SCHEDULING POLICY

A tight upper bound of the lumped disk seek time for the Scan disk sch eduling policy is presented. The tight upper bound is based on an accu rate disk seek time model. One of the most important applications of t he tight upper bound is in multimedia storage system design. Without a tight upper bound based on an accurate disk seek time model, the desi gners of multimedia storage systems would be forced to use more conser vative approaches, i.e. loose upper bounds, to guarantee satisfaction of real-time requirements. This, in turn, would result in underutiliza tion of disk bandwidth.