Abstract
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. Keywords: periodic scheduling, periodic assignment, cyclic scheduling, nonpreemptive scheduling.
| Original language | English |
|---|---|
| Place of Publication | Eindhoven |
| Publisher | Technische Universiteit Eindhoven |
| Publication status | Published - 1990 |
| Externally published | Yes |
Publication series
| Name | Memorandum COSOR |
|---|