Periodic real-time scheduling algorithms
Thesis/Dissertation
·
OSTI ID:6935762
The problem of scheduling a set of periodic-time-critical tasks on a single processor computing system is investigated. 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 nonpreemptive priority-driven algorithms for the scheduling of nonpreemptive 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. Finally, a nondeterministic scheduling system is considered 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.
- Research Organization:
- Nebraska Univ., Lincoln (USA)
- OSTI ID:
- 6935762
- Country of Publication:
- United States
- Language:
- English
Similar Records
Safe-state approach to real-time system scheduling
Guaranteed deadlines for hard real-time fault-tolerant distributed systems
Parallel job-scheduling algorithms
Technical Report
·
Fri May 12 00:00:00 EDT 1989
·
OSTI ID:7159571
Guaranteed deadlines for hard real-time fault-tolerant distributed systems
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:6037957
Parallel job-scheduling algorithms
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:5457809