Effective Real-Time Scheduling in Composite Task Model


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 3, No. 6, pp. 1568-1579, Nov. 1996
10.3745/KIPSTE.1996.3.6.1568,   PDF Download:

Abstract

Most of the real-time scheduling algorithms assume that all tasks are either preemptive of nonpreemptive. In this paper, we present a real-time scheduling algorithm for the more generalized task model in which each task contains both preemptive and nonpreemptive subtasks in a single processor environment. If the task set is found to be schedulable by the method of Harbour et al, it is also found to be schdulable by the proposed method. A simulation is used to compare two methods and the result shows the maximum of 45% difference between them in their effectiveness.


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]
K. I. Guk, "Effective Real-Time Scheduling in Composite Task Model," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 3, no. 6, pp. 1568-1579, 1996. DOI: 10.3745/KIPSTE.1996.3.6.1568.

[ACM Style]
Kim In Guk. 1996. Effective Real-Time Scheduling in Composite Task Model. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 3, 6, (1996), 1568-1579. DOI: 10.3745/KIPSTE.1996.3.6.1568.