Distributed hard real-time scheduling for a software prototyping environment
Loading...
Authors
Menezes Cordeiro, Mauricio de.
Subjects
Advisors
Shing, Man-Tak
Date of Issue
1995-03
Date
March 1995
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
Scheduling analysis is one of the most important activities in hard real-time systems development since the correctness of hard real-time systems depends not only on the logical results of computation, but also on the time at which the results are produced. This dissertation aimed at the development of both fundamental theory and software tools to support efficiently and reliably the scheduling of distributed hard real-time systems. The major work of this dissertation focuses on non-preemptive hard real-time scheduling, for periodic and sporadic task sets, although some of the results are also applicable to the Preemptive case. Several theorems for checking the schedulability of non-preemptive task sets are developed. Previous results on necessary and sufficient conditions for scheduling non-preemptive task sets are extended to cover the case when the task deadlines can be smaller or equal to their periods. The concept of transient and cyclic schedules is introduced to overcome the weakness of the traditional methods, which restrict the construction of a cyclic schedule to a fixed interval of length equal to the least common multiple of the periods.
Type
Thesis
Description
Series/Report No
Department
Computer Science
Organization
Identifiers
NPS Report Number
Sponsors
Funding
NA
Format
166p.
Citation
Distribution Statement
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.