A pre-run-time scheduling algorithm for hard real-time systems

Process scheduling, an important issue in the design and maintenance of hard real-time systems, is discussed. A pre-run-time scheduling algorithm that addresses the problem of process sequencing is presented. The algorithm is designed for multiprocessor applications with preemptable processes having...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on software engineering 1991-07, Vol.17 (7), p.669-677
Main Authors: Shepard, T., Gagne, J.A.M.
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Algorithms
Application software
Applied sciences
Computer programming
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Deadlines
Exact sciences and technology
Experiments
Multiprocessing
Other techniques and industries
Predation
Processor scheduling
Real time
Real time systems
Runtime
Schedules
Scheduling
Scheduling algorithm
Senior members
Software
Software algorithms
Software maintenance
Systems development
Timing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Process scheduling, an important issue in the design and maintenance of hard real-time systems, is discussed. A pre-run-time scheduling algorithm that addresses the problem of process sequencing is presented. The algorithm is designed for multiprocessor applications with preemptable processes having release times, computation times, deadlines and arbitrary precedence and exclusion constraints. The algorithm uses a branch-and-bound implicit enumeration technique to generate a feasible schedule for each processor. The set of feasible schedules ensures that the timing specifications of the processes are observed and that all the precedence and exclusion constraints between pairs of processes are satisfied. the algorithm was tested using a model derived from the F-18 mission computer operational flight program.< >
ISSN:0098-5589
1939-3520
DOI:10.1109/32.83903