Skip to main content
Conference Proceedings

Periodic multiprocessor scheduling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1991) 505 LNCS 166-178
DOI: 10.1007/978-3-662-25209-3_12
38Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Korst, J., Aarts, E., Lenstra, J. K., & Wessels, J. (1991). Periodic multiprocessor scheduling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 505 LNCS, pp. 166–178). Springer Verlag. https://doi.org/10.1007/978-3-662-25209-3_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free