Title :
Multiprocessor scheduling of processes with release times, deadlines, precedence, and exclusion relations
Author_Institution :
Dept. of Comput. Sci., York Univ., North York, Ont., Canada
fDate :
2/1/1993 12:00:00 AM
Abstract :
The author presents a scheduling algorithm that solves the problem of finding a feasible nonpreemptive schedule whenever one exists on M identical processors for a given set of processes such that each process starts executing after its release time and completes its computation before its deadline. A given set of precedence relations and a given set of exclusion relations defined on ordered pairs of process segments are satisfied. This algorithm can be applied to the important problem of automated pre-run-time scheduling of processes with arbitrary precedence and exclusion relations on multiprocessors in hard-real-time systems
Keywords :
multiprocessing systems; real-time systems; scheduling; automated pre-run-time scheduling; deadlines; exclusion relations; hard-real-time systems; multiprocessor scheduling; nonpreemptive schedule; precedence; release times; Algorithm design and analysis; Computer science; Processor scheduling; Runtime; Scheduling algorithm; Timing;
Journal_Title :
Software Engineering, IEEE Transactions on
