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.

Additional Metadata
Keywords Cyclic scheduling, Nonpreemptive scheduling, Periodic assignment, Periodic scheduling
Stakeholder Philips Research
Persistent URL dx.doi.org/10.1007/978-3-662-25209-3_12
Conference International Conference on Parallel Architectures and Languages Europe - PARLE
Citation
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