YEN-JEN OYANG2009-05-062018-07-052009-05-062018-07-05199500200190http://ntur.lib.ntu.edu.tw//handle/246246/155136https://www.scopus.com/inward/record.uri?eid=2-s2.0-0029327220&doi=10.1016%2f0020-0190%2895%2900055-H&partnerID=40&md5=dfb74a0c9808075efc211fe21c97b624A tight upper bound of the lumped disk seek time for the Scan disk scheduling policy is presented. The tight upper bound is based on an accurate disk seek time model. One of the most important applications of the tight upper bound is in multimedia storage system design. Without a tight upper bound based on an accurate disk seek time model, the designers of multimedia storage systems would be forced to use more conservative approaches, i.e. loose upper bounds, to guarantee satisfaction of real-time requirements. This, in turn, would result in underutilization of disk bandwidth. © 1995.application/pdf279049 bytesapplication/pdfen-USDisk scheduling; Information retrieval; Modeling; Real-time systemsBandwidth; Computer simulation; Data communication systems; Magnetic disk storage; Real time systems; Scheduling; Systems analysis; Disk bandwidth; Lumped disk seek time; Multimedia storage systems; Scan disk scheduling; Tight upper bound; Information retrieval systemsjournal article10.1016/0020-0190(95)00055-H2-s2.0-0029327220http://ntur.lib.ntu.edu.tw/bitstream/246246/155136/1/05.pdf