Disk scheduling in a multimedia I/O system
MULTIMEDIA '93 Proceedings of the first ACM international conference on Multimedia
I/O issues in a multimedia system
Computer
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Minimizing Expected Head Movement in One-Dimensional and Two-Dimensional Mass Storage Systems
ACM Computing Surveys (CSUR)
Deadline-Modification-SCAN with Maximum-Scannable-Groups for Multimedia Real-Time Disk Scheduling
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Algorithms for designing multimedia servers
Computer Communications
Multimedia file systems survey: approaches for continuous media disk scheduling
Computer Communications
Hi-index | 0.01 |
In a multimedia system, disk I/O subsystem is the most important component due to its relatively limited throughput and large delay. Previously, by applying SCAN to reschedule tasks having the same deadline, SCAN-EDF tries to improve disk throughput while real-time constraints can be satisfied. In DM-SCAN, groups of tasks that can be successfully rescheduled by SCAN under specified real-time requirements are identified. They are called MSGs (maximum-scannable-groups). In this paper, an enlarged-MSG (E-MSG) is proposed to further expand the MSG concept and thus to obtain more improvement in disk throughput. By removing some excess constraints on MSG, E-MSG merges several MSGs as a new scannable group. Experiment results show that the E-MSG scheme is better than both SCAN-EDF and MSG in the disk throughput obtained.