The real-time scheduling algorithms based on the Insertion technique and Two-way SCAN technique 


Vol. 30,  No. 6, pp. 377-386, Jun.  2005


PDF
  Abstract

Recently, to increase throughput per hour on real-time disk scheduling, a lot of algorithms that apply SCAN technique to EDF(Earliest Deadline First) that is representative real-time disk scheduling algorithm are studied. However, existing disk scheduling algorithms have several limitations because they consider continuous I/O requests when create SCAN group. Also, because SCAN technique was fixed direction, the existing algorithms have shortcoming that there are a lot of time damages. This paper proposes a new real-time disk scheduling algorithm based on the insertion technique and the two-way SCAN technique to solve the problems of the exiting real-time disk scheduling algorithms in hard real-time system. The simulation result shows that, when using our techniques, the disk throughput and the number of serviceable I/O requests are enhanced.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

M. S. Lee and C. H. Park, "The real-time scheduling algorithms based on the Insertion technique and Two-way SCAN technique," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 6, pp. 377-386, 2005. DOI: .

[ACM Style]

Myung Sub Lee and Chang Hyeon Park. 2005. The real-time scheduling algorithms based on the Insertion technique and Two-way SCAN technique. The Journal of Korean Institute of Communications and Information Sciences, 30, 6, (2005), 377-386. DOI: .

[KICS Style]

Myung Sub Lee and Chang Hyeon Park, "The real-time scheduling algorithms based on the Insertion technique and Two-way SCAN technique," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 6, pp. 377-386, 6. 2005.