The NP-Hardness and the Algorithm for Real-Time Disk-Scheduling in a Multimedia System

Authors:
Pei-Chi Huang;Wan-Chen Lu;Chun-Nan Chou;Wei-Kuan Shih
Affiliations:
National Tsing Hua University;National Tsing Hua University;National Tsing Hua University;National Tsing Hua University
Venue:
RTCSA '05 Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Year:
2005

Citing 0
Cited 3

A genetic based disk scheduling method to decrease makespan and missed tasks

Information Systems
A new real time disk-scheduling method based on GSR algorithm

Journal of Systems and Software
Hardware design of a new genetic based disk scheduling method

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Real-time disk scheduling is an important research topic for time-critical multimedia applications. Some well-known research results, such as SCAN-earliest deadline first (EDF) and DM-SCAN, applied the SCAN scheme to reschedule service sequence of input tasks and reduce their service time. In this paper, we prove that the general disk-scheduling problem with linear cost-function is NP-Hard. We also propose the shortest-task-first-DM, a new real-time disk-scheduling algorithm using the concept of the shortest-task-firstand the deadline modification. As shown in the experimental results, our approach can schedule more tasks to meet their deadlines.