ACM Home Page
Please provide us with feedback. Feedback
WRR-SCAN: a rate-based real-time disk-scheduling algorithm
Full text PdfPdf (285 KB)
Source International Conference On Embedded Software archive
Proceedings of the 4th ACM international conference on Embedded software table of contents
Pisa, Italy
SESSION: Scheduling table of contents
Pages: 86 - 94  
Year of Publication: 2004
ISBN:1-58113-860-1
Authors
Cheng-Han Tsai  National Tsing Hua University, Hsinchu, Taiwan, R.O.C
Edward T.-H. Chu  National Tsing Hua University, Hsinchu, Taiwan, R.O.C
Tai-Yi Huang  National Tsing Hua University, Hsinchu, Taiwan, R.O.C
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 32,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1017753.1017771
What is a DOI?

ABSTRACT

Traditional real-time disk-scheduling algorithms service real-time tasks according to their deadlines. Such a priority-based algorithm, although satisfying real-time constraints, yields low disk utilization due to the excessive disk-seek time. Furthermore, it results in prolonged response time or even starvation for aperiodic tasks. In this paper, we propose a novel rate-based real-time disk-scheduling algorithm called WRR-SCAN (Weighted-Round-Robin SCAN). WRR-SCAN guarantees to meet the deadline of a real-time task by reserving disk bandwidth according to its real-time constraints. WRR-SCAN services scheduled tasks in scan order to minimize the disk-seek time. In addition, WRR-SCAN delivers better response time for aperiodic tasks which are served in best-effort manner by priority based algorithms. We conducted a set of extensive experiments to compare WRR-SCAN and SCAN-EDF, a priority-based algorithm studied extensively in literature. The experimental results show that WRR-SCAN reduces non-transmission overhead significantly and produces a guaranteed minimum data rate for aperiodic tasks while keeping the deadlines of real-time tasks.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
 
4
 
5
 
6
T.-S. Chen and W.-P. Yang. Amortized Analysis of Disk Scheduling Algorithm V(R)*. Journal of Information Science and Engineering, 8(1):223--242, 1992.
 
7
8
9
10
 
11
T.-Y. Huang, C.-C. Chou, and P.-Y. Chen. Bounding the Execution Times of DMA I/O Tasks on Hard-Real-Time Embedded Systems. In Proceedings of RTCSA, pages 516--529, 2003.
 
12
I. Kamel and Y. Ito. Disk Bandwidth Study for Video Servers. Technical Report TR-153-96, Matsushita Information Technology Laboratory, 1996.
 
13
I. Kamel, T. Niranjan, and S. Ghandeharizedah. A Novel Deadline Driven Disk Scheduling Algorithm for Multi-Priority Multimedia Objects. In Proceedings of Internatilnal Conference on Data Engineering, 2002.
 
14
 
15
D. R. Kenchammana-Hosekote and J. Srivastava. Scheduling Continuous Media in a Video-On-Demand Server. In IEEE International Conference on Multimedia Computing and Systems, pages 19--28, May 1994.
 
16
M. H. Klein and T. Ralya. An Anlysis of Input/Output Paradigms for Real-Time Systems. Technical Report CMU/SEI-90-TR-19, CMU Software Engineering Institute, July 1990.
17
 
18
J. W.-S. Liu. Predictability of Real-time Software on Commodity Platform. In Lecture Notes of European Summer School on Embedded and Real-Time Systems, 2004.
 
19
P. Lougher and D. Shepherd. The Design of a Storage Server for Continuous Media. The Computer Journal, 36(1):32--42, 1993.
20
21
 
22
23
 
24
 
25
 
26

Collaborative Colleagues:
Cheng-Han Tsai: colleagues
Edward T.-H. Chu: colleagues
Tai-Yi Huang: colleagues