Answers are grounded in this paper and cite their sources.
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.>
No takes yet. Share an insight, caveat, or question.
Xu et al. (1990) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: