摘要
主要对连续媒体服务中I/O子系统的磁盘调度问题进行讨论。提出了一种新的调度算法――EDLSF(Earliest Deadline and Least Seek First)来解决连续媒体的访问。EDLSF算法综合考虑了磁盘服务时间和实时特点,通过分析、比较EDLSF算法和其它调度算法在提供并发访问数量上的多少,说明EDLSF算法是能够较好处理连续媒体请求的算法。
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.
出处
《计算机工程》
CAS
CSCD
北大核心
2001年第9期73-76,共4页
Computer Engineering