Weak Real-Time Based on Disk Storage System Scheduling Strategy

Article Preview

Abstract:

With the constant emerging of novel Internet applications, weak real-time application has gradually become the mainstream of today's Internet business. According to the characteristics and requirements of weak real-time business, this paper conducts modeling analysis on disk scheduling of weak real-time I/O requests, and gets a multi-objective optimization model of this problem, and further puts forward a heuristic weak real-time business disk scheduling strategy WRT-DSS. Experiments show that the WRT-DSS strategy can take both quality of service and throughput performance of disk storage system into consideration. According to the demand of practical scenario, WRT-DSS can make an appropriate tradeoff on the system real-time and throughput performance via the flexible adjustment of the weighting coefficients.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 962-965)

Pages:

2913-2918

Citation:

Online since:

June 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Brandt S A, Banachowski S, Lin C, et al. Dynamic integrated scheduling of hard real-time, soft real-time and non-real-time processes[C]/Real-Time Systems Symposium, 2003. RTSS 2003. 24th IEEE. IEEE, 2003: 396-407.

DOI: 10.1109/real.2003.1253287

Google Scholar

[2] Hofri M. Disk scheduling: FCFS vs. SSTF revisited [J]. Communications of the ACM, 1980, 23(11): 645-653.

DOI: 10.1145/359024.359034

Google Scholar

[3] Seltzer M, Chen P, Ousterhout J. Disk scheduling revisited[C]/Proceedings of the Winter 1990 USENIX Technical Conference. 1990: 313-323.

Google Scholar

[4] Mokbel M F, Aref W G, Elbassioni K, et al. Scalable multimedia disk scheduling[C]/Data Engineering, 2004. Proceedings. 20th International Conference on. IEEE, 2004: 498-509.

DOI: 10.1109/icde.2004.1320022

Google Scholar

[5] Reddy A L, Wyllie J. Disk scheduling in a multimedia I/O system[C]/Proceedings of the first ACM international conference on Multimedia. ACM, 1993: 225-233.

DOI: 10.1145/166266.166292

Google Scholar

[6] Kamel I, Ito Y. Disk bandwidth study for video servers[R]. Technical report, Matsushita Information Technology Laboratory, (1996).

Google Scholar

[7] Chang R I, Shih W K, Chang R C. Deadline-modification-SCAN with maximum-scannable-groups for multimedia real-time disk scheduling [C] /Real-Time Systems Symposium, 1998. Proceedings, The 19th IEEE. IEEE, 1998: 40-49.

DOI: 10.1109/real.1998.739729

Google Scholar

[8] Geist R, Daniel S. A continuum of disk scheduling algorithms [J]. ACM Transactions on Computer Systems (TOCS), 1987, 5(1): 77-92.

DOI: 10.1145/7351.8929

Google Scholar

[9] Zimmermann H J. Fuzzy set theory-and its applications [M]. Springer, (2001).

Google Scholar