Principles of delay-sensitive multimedia data storage retrieval
ACM Transactions on Information Systems (TOIS)
A file system for continuous media
ACM Transactions on Computer Systems (TOCS)
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)
Journal of Systems and Software
Deadline-Modification-SCAN with Maximum-Scannable-Groups for Multimedia Real-Time Disk Scheduling
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Real-Time Disk Storage and Retrieval of Digital Audio/Video Data
Real-Time Disk Storage and Retrieval of Digital Audio/Video Data
Multimedia file systems survey: approaches for continuous media disk scheduling
Computer Communications
Efficient guaranteed disk request scheduling with fahrrad
Proceedings of the 3rd ACM SIGOPS/EuroSys European Conference on Computer Systems 2008
A genetic based disk scheduling method to decrease makespan and missed tasks
Information Systems
Horizon: efficient deadline-driven disk I/O management for distributed storage systems
Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
Hardware design of a new genetic based disk scheduling method
Real-Time Systems
Reward Scheduling for QoS in Cloud Applications
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
Hi-index | 0.00 |
Earliest-deadline-first (EDF) is good for scheduling real-time tasks in order to meet timing constraint. However, it is not good enough for scheduling real-time disk tasks to achieve high disk throughput. In contrast, although SCAN can maximize disk throughput, its schedule results may violate real-time requirements. Thus, during the past few years, various approaches were proposed to combine EDF and SCAN (e.g., SCAN-EDF and RG-SCAN) to resolve the real-time disk-scheduling problem. However, in previous schemes, real-time tasks can only be rescheduled by SCAN within a local group. Such restriction limited the obtained data throughput. In this paper, we proposed a new globally rescheduling scheme for real-time disk scheduling. First, we formulate the relations between the EDF schedule and the SCAN schedule of input tasks as EDF-to-SCAN mapping (ESM). Then, on the basis of ESM, we propose a new real-time disk-scheduling algorithm: globally seek-optimizing rescheduling (GSR) scheme. Different from previous approaches, a task in GSR may be rescheduled to anywhere in the input schedule to optimize data throughput. Owing to such a globally rescheduling characteristic, GSR obtains a higher disk throughput than previous approaches. Furthermore, we also extend the GSR to serve fairly non-real-time tasks. Experiments show that given 15 real-time tasks, our data throughput is 1.1 times that of RG-SCAN. In addition, in a mixed workload, compared with RG-SCAN, our GSR achieves over 7% improvement in data throughput and 33% improvement in average response time.