An efficient heuristic scheduler for hard real-time systems.

134 Pages·2.2 MB·en_US

by  Levine, John Glenn.;Shing, Man-Tak.;LuQi.

30L
9S843-60O*.

NAVAL POSTGRADUATE SCHOOL
Monterey, California
THESIS
AN EFFICIENT HEURISTIC
SCHEDULER FOR HARD
REAL-TIME SYSTEMS
by
John Glenn Levine
September 1991
Thesis Advisor: Man-Tak Shing
Co-Advisor: LuQi
Approved forpublic release; distribution is unlimited.

Unclassified
Security Classification of this page
REPORT DOCUMENTATION PAGE
UNCLASSIFIED
la Report Security Classification 1b Restrictive Markings
2a Security Classification Authority 3 Distribution Availability of Report
2b Declassification''Downgrading Schedule Approved forpublic release; distribution is unlimited.
4 Performing Organization Report Number(s) 5 Monitoring Organization Report Number(s)
6a Name of Performing Organization 6b Office Symbol 7a Name of Monitoring Organization
Naval Postgraduate School (If Applicable) Naval Postgraduate School
cs
6c Address (city, state, andZIPcode) 7b Address (city, state, andZIPcode)
Monterey, CA 93943-5000 Monterey, CA 93943-5000
8a Name of Funding/Sponsoring Organization 8b Office Symbol 9 Procurement Instrument Identification Number
(If Applicable)
National Science Foundation CCR-9058453
NW
8c Address (city, state, andZIPcode) 1800 G. St. , 1 Source of Funding Numbers
Washington, DC 20550
ProgramDementNumber ProjectNo Task No Work UnitAccessionNo
AN EFFICIENT HEURISTIC SCHEDULER FOR HARD REAL-TIME
11 Title (Include Security Classification)
SYSTEMS
12 Personal Authors) John Glenn Levine
13a Type of Report 13b Time Covered 14 Date ofReport (year, month,day) 15 Page Count
Master's Thesis From To 1991, September 120
16 Supplementary Notation The views expressed inthis paper are those of the author and do not reflect the official
policy orposition of the Department of Defense or the U.S. Government.
17 Cosati Codes 18 Subject Terms (continue on reverse ifnecessary and identify by block number)
Field Group Subgroup Rapid prototyping; hard real-time systems; simulated annealing
19 Abstract (continue on reverse if necessaryandidentify by block number
The requirementfor efficient scheduling algorithms forthe development ofhard real-time systems resulted in
much effort directed toward the development ofhigh performance scheduling algorithms. The algorithms
developed up to this point forthe Computer Aided Prototyping System (CAPS) do not satisfy the requirements
for a efficient static scheduling algorithm. The existing static schedulerneitherperforms efficiently norproduces
correct results for all input cases.
This thesis represents the research conducted to develop afastheuristic 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 ofthe existing scheduling algorithms
were re-implemented to make use of the new data structures and provide correctresults. Anyfeasible schedule
produced bythese scheduling algorithms guarantees that both timing and precedence constraints are met. The
primary goal ofthis thesis was to produce an efficient and effective scheduler to support the CAPS system.
20 Distribution/Availability of Abstract 21 Abstract Security Classification
[X unclassified/unlimited same as report DTICusers Unclassified
I
22a Name of Responsible Individual 22b Telephone (Include Area code) 22c Office Symbol
M. Shing [phone] CS/Sh
DD FORM 1473, 84 MAR 83 APR edition may be used until exhausted security classification of this page
All other editions are obsolete Unclassified
Approved for public release; distribution is unlimited
ANEFFICIENTHEURISTIC
SCHEDULER FOR HARD
REAL-TIME SYSTEMS
by
John Glenn Levine
Cpt, U.S. Army
B.S., U.S.M.A., 1983
Submitted in partial fulfillment ofthe
requirements for the degree of
MASTER OF COMPUTER SCIENCE
from the
NAVAL POSTGRADUATE SCHOOL
26 September 1991