The Community for Technology Leaders
Green Image
<p>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.</p>
multiprocessor scheduling; release times; deadlines; precedence; exclusion relations; nonpreemptive schedule; automated pre-run-time scheduling; hard-real-time systems; multiprocessing systems; real-time systems; scheduling

J. Xu, "Multiprocessor Scheduling of Processes with Release Times, Deadlines, Precedence, and Exclusion Relations," in IEEE Transactions on Software Engineering, vol. 19, no. , pp. 139-154, 1993.
81 ms
(Ver 3.3 (11022016))