摘要： 主要对连续媒体服务中Ｉ／Ｏ子系统的磁盘调度问题进行讨论。提出了一种新的调度算法――ＥＤＬＳＦ（Ｅａｒｌｉｅｓｔ　Ｄｅａｄｌｉｎｅ　ａｎｄ　Ｌｅａｓｔ　Ｓｅｅｋ　Ｆｉｒｓｔ）来解决连续媒体的访问。ＥＤＬＳＦ算法综合考虑了磁盘服务时间和实时特点，通过分析、比较ＥＤＬＳＦ算法和其它调度算法在提供并发访问数量上的多少，说明ＥＤＬＳＦ算法是能够较好处理连续媒体请求的算法。

关键词: 连续媒体, 期限, 磁盘服务时间, 寻道, I/O调度

Abstract: In this paper, the disk scheduling of I/O in continuous media service system is discussed. In order to satisfy the requirement of continuous media, a new scheduling algorithm-EDLSF(Earliest Deadline and Least Seek First) is proposed in this paper. In the EDLSF algorithm, both disk service time and real time requirement are taken into account. By analyzing it and comparing it to other scheduling algorithms in terms of supporting concurrent access, EDLSF is more suitable and better than the others.

中图分类号: 

• TN919.8