Static scheduler for hard real-time tasks on multiprocessor systems
MetadataShow full item record
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.
Approved for public release; distribution is unlimited
Showing items related by title, author, creator and subject.
Fan, Bao-Hua (Monterey, California. Naval Postgraduate School, 1990-06);The Computer Aided Prototyping System (CAPS) and the Prototype system Description Language (PSDL) represent a pioneering effort in the field of software development. Execution Support System (ESS) within the framework of ...
Janson, Dorothy M. (Monterey, California. Naval Postgraduate School, 1988-03);As demand for hard real-time and embedded computer systems increases, a new approach to software development is critical. Software engineers and users would benefit from an automated methodology allowing validation of ...
Levine, John Glenn (Monterey, California. Naval Postgraduate School, 1991-09);The requirement for efficient scheduling algorithms for the development of hard real-time systems resulted in much effort directed toward the development of high performance scheduling algorithms. The algorithms developed ...