Title :
Scheduling processes with release times, deadlines, precedence and exclusion relations
Author :
Xu, Jia ; Parnas, David Lorge
Author_Institution :
Dept. of Comput. Sci., York Univ., North York, Ont., Canada
fDate :
3/1/1990 12:00:00 AM
Abstract :
An algorithm that finds an optimal schedule on a single processor for a given set of processes is presented. Each process starts executing after its release time and completes its computation before its deadline and a given set of precedence relations and exclusion relations defined on ordered pairs of process segments are satisfied. This algorithm can be applied to the important and previously unsolved problem of automated pre-run-time scheduling of processes with arbitrary precedence and exclusion in hard-real-time systems
Keywords :
optimisation; scheduling; search problems; arbitrary precedence; automated pre-run-time scheduling; exclusion relations; hard-real-time systems; optimal schedule; ordered pairs; precedence relations; process segments; release time; single processor; Algorithm design and analysis; Councils; Optimal scheduling; Processor scheduling; Real time systems; Runtime; Scheduling algorithm; Timing;
Journal_Title :
Software Engineering, IEEE Transactions on
