Performance Improvement of Soft Real-Time Scheduler in OSF/1


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 1, pp. 246-254, Jan. 1997
10.3745/KIPSTE.1997.4.1.246,   PDF Download:

Abstract

This paper proposes an improved scheduling model and algorithm which threads in the fixed-priority policy have faster response time and turnaround time than existing ones in SRT system. Sub run queue is added into the system and is used for the quick execution and aging of threads in the fixed-priority policy. Using simulation two method are compared. The results shows that net scheduling model gets threads in the fixed-priority policy to run faster than existing ones.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
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]
L. S. Ho and H. Shin, "Performance Improvement of Soft Real-Time Scheduler in OSF/1," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 4, no. 1, pp. 246-254, 1997. DOI: 10.3745/KIPSTE.1997.4.1.246.

[ACM Style]
Lee Seung Ho and Heu Shin. 1997. Performance Improvement of Soft Real-Time Scheduler in OSF/1. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 4, 1, (1997), 246-254. DOI: 10.3745/KIPSTE.1997.4.1.246.