| 连续媒体服务的磁盘调度算法—EDLSF |
| |
| 引用本文： | 黄清华,王光彩,顾君忠. 连续媒体服务的磁盘调度算法—EDLSF[J]. 计算机工程, 2001, 27(9): 73-76 |
| |
| 作者姓名： | 黄清华 王光彩 顾君忠 |
| |
| 作者单位： | 华东师范大学计算机系 |
| |
| 摘 要： | 主要对连续媒体服务中I／O子系统的磁盘调度问题进行讨论。提出了一种新的调度算法－EDLSF（Earliest Deadine and Least Seek First)来解决连续媒体的访问。EDLSF算法综合考虑了磁盘服务时间和实时特点，通过分析、比较EDLISF算法和其它调度算法在提供并发访问数量上的多少，说明EDLSF算法是能够较好处理连续媒体请求的算法。
|
| 关 键 词： | 连续媒体 磁盘服务时间 磁盘调度算法 EDLSF 多媒体 |
| 文章编号： | 1000-3428(2001)09-0073-03 |
| 修稿时间： | 2001-01-12 |
Algorithm of Disk Scheduling in Continuous Media Service -- EDLSF |
| |
| HUANG Qinghua,WANG Guangcai,GU Junzhong. Algorithm of Disk Scheduling in Continuous Media Service -- EDLSF[J]. Computer Engineering, 2001, 27(9): 73-76 |
| |
| Authors: | HUANG Qinghua WANG Guangcai GU Junzhong |
| |
| 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. |
| |
| Keywords: | Continuous media Deadline Disk service time Seeking I/O scheduling |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
