Static Scheduler for Hard Real-Time Tasks on Multiprocessor Systems
Abstract
Task scheduling is one of the most important issues in a hard real- time system, because it is the schedule that ensures the tasks meet their deadlines and precedence constraints. Given a set of hard real-time tasks, to determine whether a feasible schedule exists such that the timing constraints and precedence constraints of the tasks are satisfied, and to produce such a schedule if one exists are the purposes of a static scheduler. The previous work done for the static scheduler in the computer aided prototyping system (CAPS) was mainly for the single processor environment. The major work of this thesis is to develop several algorithms for scheduling hard real-time tasks on multiprocessor systems so that the associated timing and precedence constraints, as well as the communication requirements are met under the worst-case situation. hard real-time systems; static scheduler; multiprocessor scheduling; earliest start first; earliest deadline first; simulated annealing.
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 01, 1992
- Accession Number
- ADA257663
Entities
People
- Tzu-chiang Chang
Organizations
- Naval Postgraduate School