Paper Info
Title
Enlarged-Maximum-Scannable-Groups for Real-Time Disk Scheduling in a Multimedia System
Abstract
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.
Year
DOI
Venue
2000
10.1109/CMPSAC.2000.884752
COMPSAC
Keywords
Field
DocType
real-time constraint,limited throughput,specified real-time requirement,e-msg scheme,multimedia system,o subsystem,real-time disk,excess constraint,experiment result,disk throughput,important component,msg concept,real time systems,resource allocation,throughput,scheduling,satisfiability,disk scheduling,real time,scan,scheduling algorithm
I/O scheduling,Computer science,Scheduling (computing),Constraint theory,Real-time computing,Resource allocation,Multimedia system,Throughput
Conference
Volume
ISSN
ISBN
24
0730-3157
0-7695-0792-1
Citations 
PageRank 
References 
4
0.46
11
Authors
4
Name
Order
Citations
PageRank
Hsung-Pin Chang18712.94
Ruei-Chuan Chang226756.19
Ray-I Chang323832.52
Wei Kuan Shih49512.50