Distributed hard real-time scheduling for a software prototyping environment
Menezes Cordeiro, Mauricio de.
MetadataShow full item record
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.
Showing items related by title, author, creator and subject.
George, Robert; Kanayama, Yutaka (1996-04);Most existing real-time control systems use ad hoc static priority scheduling methods, in spite of the fact that the rate monotonic scheduling algorithm was proved to be the optimal static priority scheduling algorithm ...
Kelly, Timothy James (Monterey, California. Naval Postgraduate School, 1993-03);As recognized in the software engineering process, software testing during development is an aspect that must be improved to accurately predict and reduce probabilities of future software failures. A possible method of ...
Negelspach, Greg L. (Monterey, California. Naval Postgraduate School, 1994-09);Optimal scheduling of parallel programs onto multiprocessor computers is an exponentially hard problem. Because of this, most scheduling algorithms in use today rely on heuristics to determine the best balance of computation ...