登入選單

返回Google圖書搜尋

Performance Evaluation of Two New Disk Scheduling Algorithms for Real-time Systems

University of Massachusetts at Amherst. Department of Computer and Information Science

出版	University of Massachusetts at Amherst, Department of Computer and Information Science, 1990
URL	http://books.google.com.hk/books?id=amHCHAAACAAJ&hl=&source=gbs_api

註釋

Abstract: "In this paper, we present two new disk scheduling algorithms for real-time systems. The two algorithms, called SSEDO (for Shortest Seek and Earliest Deadline by Ordering) and SSEDV (for Shortest Seek and Earliest Deadline by Value), combine deadline information and disk service time information in different ways. The basic idea behind these new algorithms is to give the disk I/O request with the earliest deadline a high priority, but if a request with a larger deadline is 'very' close to the current disk arm position, then it may be assigned the highest priority.