A number of scheduling and assignment problems are presented involving the execution of periodic operations in a multiprocessor environment. We consider the computational complexity of these problems and propose approximation algorithms for operations with identical periods as well as for operations with arbitrary integer periods
URL : http://www.date-conference.com/conference/proceedings/PAPERS/2007/YEAR_DATE07.phpInternational...
International audienceMultiprocessor scheduling problems are hard because of the numerous constraint...
We present a two-stage solution approach to the multidimensional periodic scheduling (MPS) problem. ...
A number of scheduling and assignment problems are presented involving the execution of periodic ope...
The problem of allocating a set of periodic-time-critical tasks to processors in a multiprocessor sy...
The problem of scheduling a set of periodic-time-critical tasks on a single-processor computing syst...
The problem of preemptive scheduling a set of periodic tasks on multiprocessors is studied from the ...
We consider the problem of nonpreemptively scheduling periodic tasks on a minimum number of processo...
AbstractWe discuss the computational complexity of the multidimensional periodic scheduling problem....
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even i...
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even i...
International audienceIn this paper we study global fixed-priority scheduling of periodic task syste...
We discuss the computational complexity of the multidimensional periodic scheduling problem. This pr...
Multiprocessor scheduling problems are hard because of the numerous constraints on valid schedules t...
Real time systems have been a major area of study for many years. Advancements in electronics, compu...
URL : http://www.date-conference.com/conference/proceedings/PAPERS/2007/YEAR_DATE07.phpInternational...
International audienceMultiprocessor scheduling problems are hard because of the numerous constraint...
We present a two-stage solution approach to the multidimensional periodic scheduling (MPS) problem. ...
A number of scheduling and assignment problems are presented involving the execution of periodic ope...
The problem of allocating a set of periodic-time-critical tasks to processors in a multiprocessor sy...
The problem of scheduling a set of periodic-time-critical tasks on a single-processor computing syst...
The problem of preemptive scheduling a set of periodic tasks on multiprocessors is studied from the ...
We consider the problem of nonpreemptively scheduling periodic tasks on a minimum number of processo...
AbstractWe discuss the computational complexity of the multidimensional periodic scheduling problem....
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even i...
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even i...
International audienceIn this paper we study global fixed-priority scheduling of periodic task syste...
We discuss the computational complexity of the multidimensional periodic scheduling problem. This pr...
Multiprocessor scheduling problems are hard because of the numerous constraints on valid schedules t...
Real time systems have been a major area of study for many years. Advancements in electronics, compu...
URL : http://www.date-conference.com/conference/proceedings/PAPERS/2007/YEAR_DATE07.phpInternational...
International audienceMultiprocessor scheduling problems are hard because of the numerous constraint...
We present a two-stage solution approach to the multidimensional periodic scheduling (MPS) problem. ...
DOI
Add to ORKG