loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'05)
The NP-Hardness and the Algorithm for Real-Time Disk-Scheduling in a Multimedia System
Hong Kong, China
August 17-August 19
ISBN: 0-7695-2346-3
ASCII Text
x 
 
Pei-Chi Huang, Wan-Chen Lu, Chun-Nan Chou, Wei-Kuan Shih, "The NP-Hardness and the Algorithm for Real-Time Disk-Scheduling in a Multimedia System," Real-Time Computing Systems and Applications, International Workshop on, pp. 260-265, 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/RTCSA.2005.98,
author = {Pei-Chi Huang and Wan-Chen Lu and Chun-Nan Chou and Wei-Kuan Shih},
title = {The NP-Hardness and the Algorithm for Real-Time Disk-Scheduling in a Multimedia System},
journal ={Real-Time Computing Systems and Applications, International Workshop on},
volume = {0},
year = {2005},
issn = {1533-2306},
pages = {260-265},
doi = {http://doi.ieeecomputersociety.org/10.1109/RTCSA.2005.98},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Real-Time Computing Systems and Applications, International Workshop on
TI - The NP-Hardness and the Algorithm for Real-Time Disk-Scheduling in a Multimedia System
SN - 1533-2306
SP260
EP265
A1 - Pei-Chi Huang,
A1 - Wan-Chen Lu,
A1 - Chun-Nan Chou,
A1 - Wei-Kuan Shih,
PY - 2005
KW - null
VL - 0
JA - Real-Time Computing Systems and Applications, International Workshop on
ER -
 
Pei-Chi Huang, National Tsing Hua University
Wan-Chen Lu, National Tsing Hua University
Chun-Nan Chou, National Tsing Hua University
Wei-Kuan Shih, National Tsing Hua University
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-first and the deadline modification. As shown in the experimental results, our approach can schedule more tasks to meet their deadlines.
Citation:
Pei-Chi Huang, Wan-Chen Lu, Chun-Nan Chou, Wei-Kuan Shih, "The NP-Hardness and the Algorithm for Real-Time Disk-Scheduling in a Multimedia System," rtcsa, pp.260-265, 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.