Add to ORKGA 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. Keywords: periodic scheduling, periodic assignment, cyclic scheduling, nonpreemptive scheduling
In this paper, the problem of preemptively scheduling a set of periodic tasks on a multiprocessor is...
This paper is proposing a general periodicity result concerning any deterministic and memoryless sch...
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 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...
International audienceWe present a new representation for the scheduling problem that allows a signi...
Multiprocessor scheduling problems are hard because of the numerous constraints on valid schedules t...
The problem of scheduling a set of periodic-time-critical tasks on a single-processor computing syst...
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...
In this paper, the problem of preemptively scheduling a set of periodic tasks on a multiprocessor is...
This paper is proposing a general periodicity result concerning any deterministic and memoryless sch...
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 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...
International audienceWe present a new representation for the scheduling problem that allows a signi...
Multiprocessor scheduling problems are hard because of the numerous constraints on valid schedules t...
The problem of scheduling a set of periodic-time-critical tasks on a single-processor computing syst...
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...
In this paper, the problem of preemptively scheduling a set of periodic tasks on a multiprocessor is...
This paper is proposing a general periodicity result concerning any deterministic and memoryless sch...
We present a two-stage solution approach to the multidimensional periodic scheduling (MPS) problem. ...