2008
DOI: 10.1109/tc.2007.70823
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Real-Time Disk-Scheduling Framework with Adaptive Quality Guarantee

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 52 publications
0
1
0
Order By: Relevance
“…Z. Dimitrijevic, R. Rangaswami and E. Y. Chang have presented Semipreemptible I/O, which divides disk I/O requests into small temporal units of disk commands to improve the preemptibility of disk access [4]. Cheng -Han Tsai, Tai -Yi Huang, Edward T. -H. Chu, Chun-Hang Wei and Yu -Che Tsai propose a novel real-time disk-scheduling algorithm called WRR -SCAN (Weighted-Round-Robin-SCAN) to provide quality guarantees for all in-service streams encoded at variable bit rates and bounded response times for aperiodic jobs [5]. Daniel L. Martens and Michael J. Katchabaw developed a new disk scheduling algorithm focuses on dynamic scheduling algorithm selection and tuning [6].…”
Section: Related Work Donementioning
confidence: 99%
“…Z. Dimitrijevic, R. Rangaswami and E. Y. Chang have presented Semipreemptible I/O, which divides disk I/O requests into small temporal units of disk commands to improve the preemptibility of disk access [4]. Cheng -Han Tsai, Tai -Yi Huang, Edward T. -H. Chu, Chun-Hang Wei and Yu -Che Tsai propose a novel real-time disk-scheduling algorithm called WRR -SCAN (Weighted-Round-Robin-SCAN) to provide quality guarantees for all in-service streams encoded at variable bit rates and bounded response times for aperiodic jobs [5]. Daniel L. Martens and Michael J. Katchabaw developed a new disk scheduling algorithm focuses on dynamic scheduling algorithm selection and tuning [6].…”
Section: Related Work Donementioning
confidence: 99%