Publication:
Static scheduler for hard real-time tasks on multiprocessor systems

Loading...
Thumbnail Image
Authors
Chang, Tzu-Chiang
Subjects
Hard real-time systems
Static scheduler
Multiprocessor scheduling
Earliest start first
Earliest deadline first
Simulated annealing
Advisors
Shing, Man-Tak
Date of Issue
1992-09
Date
September 1992
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
Task scheduling is one of the most important issues in a hard real-time system, because it is the schedule that ensures 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 purposed 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 scenario.
Type
Thesis
Description
Series/Report No
Department
Electronic Warfare Academic Group
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
Sponsors
Funder
Format
142 p.
Citation
Distribution Statement
Approved for public release; distribution is unlimited.
Rights
Copyright is reserved by the copyright owner
Collections