Dynamic CPU Scheduling With Imprecise Knowledge Of Computation-Time
S. A. Aldarmi and Alan Burns
The majority of the studies conducted in scheduling real-time transactions mostly concentrate on concurrency control protocols, while overlooking the CPU as being the primary resource. Consequently, there are various techniques for scheduling the CPU in conventional time-critical systems; meanwhile, there does not seem to be any technique that is adequately designed for scheduling such a resource in Real-Time Database (RTDB) systems. In this paper, we construct an efficient CPU scheduling scheme that minimizes the preemption rate in order to reduce the frequency by which synchronization protocols must be invoked, along with their inherited performance degradation. In addition, we also introduce a new timing model upon which the newly introduced scheduler is incorporated in order to utilize the system's imprecise knowledge of computation time estimates.
BibTex Entry
@inproceedings{Aldarmi1999b,
address = {Germany},
author = {S. A. Aldarmi and Alan Burns},
booktitle = {The Joint 24th IFAC/IFIP Workshop on Real Time Programming and Third International Workshop on Active and Real-Time Database Systems},
category = {scheduling},
month = {May/Jun},
title = {Dynamic CPU Scheduling With Imprecise Knowledge Of Computation-Time},
year = {1999}
}