Two-Level Scheduling for Soft Real-Time Systems


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 6, No. 2, pp. 467-475, Feb. 1999
10.3745/KIPSTE.1999.6.2.467,   PDF Download:

Abstract

This paper presents an algorithm for scheduling jobs in soft real-time systems. To simplify the scheduling for soft real-time systems, we introduce two-level deadline scheme. Each job in the system has two deadlines, which we call first-level and second-level deadlines, respectively. The first-level deadline is the same as deadline in traditional real-time systems. The second-level deadline is later than the first-level deadline, and defines the latest point in time when the result is still acceptable. Partial-credit is given for jobs meeting the second-level deadline but missing the first-level deadline, whereas jobs meeting the latter are given full credit. We heuristically compute priorities of jobs in a dynamic way by combining the first-level and second-level deadlines with the partial-credit. Simulation results indicate that our two-level scheduling algorithm is a viahle approach for dealing with both soft real-time systems and temporary overloaded hard real-time systems.


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. J. Hoon, "Two-Level Scheduling for Soft Real-Time Systems," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 6, no. 2, pp. 467-475, 1999. DOI: 10.3745/KIPSTE.1999.6.2.467.

[ACM Style]
Kim Jai Hoon. 1999. Two-Level Scheduling for Soft Real-Time Systems. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 6, 2, (1999), 467-475. DOI: 10.3745/KIPSTE.1999.6.2.467.