An efficient heuristic scheduler for hard real-time systems
Loading...
Authors
Levine, John Glenn
Subjects
Rapid prototyping
Hard real-time systems
Simulated annealing
Hard real-time systems
Simulated annealing
Advisors
Shing, Man-Tak
Luqi
Date of Issue
1991-09
Date
September 1991
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
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 up to this point for the Computer Aided Prototyping System (CAPS) do not satisfy the requirements for a efficient static scheduling algorithm. The existing static scheduler neither performs efficiently nor produces correct results for all input cases. The thesis represents the research conducted to develop a fast heuristic static scheduling algorithm based on the principles of simulated annealing. In addition, this thesis describes the development of new data structures that simplify the static scheduler and maximize system resources. Several of the existing scheduling algorithms were re-implemented to make use of the new data structures and provide correct results. Any feasible schedule produced by these scheduling algorithms guarantees that both timing and precedence constraints are met. The primary goal of this thesis was to produce an efficient and effective scheduler to support the CAPS system.
Type
Thesis
Description
Series/Report No
Department
Department of Computer Science
Organization
Naval Postgraduate School
Identifiers
NPS Report Number
Sponsors
Funder
Format
113 p.
Citation
Distribution Statement
Approved for public release; distribution is unlimited.
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.