Off-campus UNL users: To download campus access dissertations, please use the following link to log into our proxy server with your NU ID and password. When you are done browsing please remember to return to this page and log out.

Non-UNL users: Please talk to your librarian about requesting this dissertation through interlibrary loan.

ON PERIODIC REAL-TIME SCHEDULING ALGORITHMS

MAN CHEONG KONG, University of Nebraska - Lincoln

Abstract

The problem of scheduling a set of periodic-time-critical tasks on a single-processor computing system is investigated. A periodic-time-critical task is a computational procedure consisting of an infinite sequence of requests, arising periodically, each of which has a prescribed deadline. The objective here is to schedule the processing of the tasks such that all requests are completely executed by their prescribed deadlines. Existing results on independent periodic real-time scheduling are extended and generalized. The class of priority-driven algorithms is shown to be asymptotically optimal in time complexity. When tasks to be scheduled are dependent, an optimal algorithm and its characterization are devised and analyzed. A class of non-preemptive priority-driven algorithms for the scheduling of non-preemptive periodic-time-critical tasks is also developed. When additional restrictions are imposed on the request-periods of the tasks, optimal algorithms are devised and analyzed. Necessary and sufficient conditions that can guarantee a non-preemptive task set to be schedulable are obtained. Finally, we consider a non-deterministic scheduling system in which vital information describing the tasks to be scheduled is not completely known in advance. An optimal algorithm for the scheduling of a set of randomly arriving time-critical tasks in this environment is developed. The relationship of this non-deterministic model with independent periodic real-time scheduling systems is examined and analyzed.

Subject Area

Computer science

Recommended Citation

KONG, MAN CHEONG, "ON PERIODIC REAL-TIME SCHEDULING ALGORITHMS" (1986). ETD collection for University of Nebraska-Lincoln. AAI8620813.
https://digitalcommons.unl.edu/dissertations/AAI8620813

Share

COinS