摘要
本文对双头镜像磁盘系统模型进行实时扩展,并提出了三种实时调度算法:最早截止期优先算法(EDF),可满足的最早截止期优先算法(F-EDF)和忽视超时限请求算法(IGM-EDF).这三种算法充分考虑了I/O请求的截止期限,使双头镜像磁盘系统能更好地满足实时需求.在进行了性能模拟后,发现实时调度算法比非实时算法能更好地满足实时I/O请求的时限要求.三种实时调度算法中,适用于硬实时应用的IGM-EDF的性能最好,F-EDF算法的性能次之,它适用于软实时环境.
This paper extends the two headed mirrored disk model proposed by author's, and presents a real time model for two headed mirrored disk systems. Non real time disk scheduling algorithms for such disk system have been examined, this paper proposes three real time scheduling algorithms: earliest deadline first(EDF), feasible earliest deadline first(F EDF) and ignore missed deadlines(IGM EDF). These three algorithms take deadlines of I/O requests into consideration, so they are useful in the real time applications. The simulation experiments show that real time algorithms perform better than non real time algorithms when serving real time I/O requests. Among real time algorithms, IGM EDF is the best one when employed in the hard real time environment, F EDF is the next best one, and it is useful in soft real time applications.
出处
《计算机学报》
EI
CSCD
北大核心
1999年第2期212-217,共6页
Chinese Journal of Computers
基金
国防预研基金
关键词
双头镜像磁盘
调度算法
性能评价
操作系统
Two headed mirrored disk system, real time disk scheduling, I/O request, simulation experiment, performance evaluations.