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.

, , ,
Philips Research
doi.org/10.1007/978-3-662-25209-3_12
International Conference on Parallel Architectures and Languages Europe - PARLE
Centrum Wiskunde & Informatica, Amsterdam, The Netherlands

Korst, J, Aarts, E.H.L, Lenstra, J.K, & Wessels, J. (1991). Periodic multiprocessor scheduling. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence (pp. 166–178). doi:10.1007/978-3-662-25209-3_12