Abstract-We present an algorithm that finds an optimal schedule on a single processor for a given set of processes such that each process starts executing after its release time and completes its computation before its deadline, and 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 and previously unsolved problem of automated pre-run-time scheduling of processes with arbitrary precedence and exclusion relations in hardreal-time systems.
Xu and Parnas REF present a branch-and-bound algorithm that finds an optimal pre-runtime schedule on a single processor for real-time process segments with release, deadlines, and arbitrary exclusion and precedence relations.
Scheduling processes with release times, deadlines, precedence and exclusion relations
IEEE Trans. Software Eng.
IEEE Trans. Software Eng.
Computer Science