Scheduling processes with release times, deadlines, precedence and exclusion relations
IEEE Transactions on Software Engineering1990Vol. 16(3), pp. 360–369
Citations Over TimeTop 10% of 1990 papers
Abstract
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.>
Related Papers
- → Compiler-assisted dynamic scheduling for effective parallelization of loop nests on multicore processors(2009)55 cited
- → Scheduling Sporadic Tasks on Multiprocessors with Mutual Exclusion Constraints(2009)3 cited
- → Partitioned scheduling of periodic real-time tasks onto reconfigurable hardware(2006)7 cited
- → Guidelines for data-parallel cycle-stealing in networks of workstations. II. On maximizing guaranteed output(2003)3 cited
- → A scheduling technique for real-time systems with end-to-end timing constraints(2002)2 cited