scientific article; zbMATH DE number 108489
In this PhD thesis periodic scheduling problems motivated from applications in digital video signal processing are considered. Jobs consit of operations to be processed without preemption repeatedly on a number of processors. There are either strict periodicity constraints or slack periodicity constraints. In the first case the operations must repeat with a given period. In the second case there are periodically repeating intervals in which the repeating operations can be scheduled arbitrarily. Between the processing periods a job must be stored. The problem is to find a feasible schedule which minimizes a linear combination of the number of machines and the storage requirement needed. Additionally there may be precedence constraints between the jobs or constraints requiring that all execution of a periodic operation are executed on the same processor. Due to its complexity the problem is decomposed into subproblems. Each of these subproblems is discussed in detail. The derived results are an important contribution to the theory of periodic scheduling.
- The complexity of multidimensional periodic scheduling
- Vehicle minimization for periodic deliveries
- Deadline-based scheduling of periodic task systems on multiprocessors.
- A variable-depth search algorithm for the recursive bipartitioning of signal flow graphs
- Periodic scheduling for cache-miss minimisation
- Line search method for solving a non-preemptive strictly periodic scheduling problem
- Strictly periodic scheduling in IMA-based architectures
- Video signal processor scheduling
- A multiperiod single processor scheduling problem with periodic requirements
- Tabu search algorithms for cyclic machine scheduling problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4023942)