https://scholars.lib.ntu.edu.tw/handle/123456789/118325
標題: | A tight upper bound of the lumped disk seek time for the Scan disk scheduling policy | 作者: | YEN-JEN OYANG | 關鍵字: | Disk scheduling; Information retrieval; Modeling; Real-time systems | 公開日期: | 1995 | 卷: | 54 | 期: | 6 | 起(迄)頁: | 355-358 | 來源出版物: | Information Processing Letters | 摘要: | 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. |
URI: | http://ntur.lib.ntu.edu.tw//handle/246246/155136 https://www.scopus.com/inward/record.uri?eid=2-s2.0-0029327220&doi=10.1016%2f0020-0190%2895%2900055-H&partnerID=40&md5=dfb74a0c9808075efc211fe21c97b624 |
ISSN: | 00200190 | DOI: | 10.1016/0020-0190(95)00055-H | SDG/關鍵字: | 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 |
顯示於: | 資訊工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。