The Community for Technology Leaders
Green Image
<p>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.</p>
optimal schedule; single processor; release time; precedence relations; exclusion relations; ordered pairs; process segments; automated pre-run-time scheduling; arbitrary precedence; hard-real-time systems; optimisation; scheduling; search problems.

J. Xu and D. Parnas, "Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations," in IEEE Transactions on Software Engineering, vol. 16, no. , pp. 360-369, 1990.
94 ms
(Ver 3.1 (10032016))