A tight upper bound of the lumped disk seek time for the Scan disk scheduling policy
Journal
Information Processing Letters
Journal Volume
54
Journal Issue
6
Pages
355-358
Date Issued
1995
Date
1995
Author(s)
Abstract
A 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.
Subjects
Disk scheduling; Information retrieval; Modeling; Real-time systems
Other Subjects
Bandwidth; 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 systems
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
05.pdf
Size
272.51 KB
Format
Adobe PDF
Checksum
(MD5):311f5abf481f8a5d800d38bfab914850