Skip to main content
Conference Proceedings

An approximation algorithm for preemptive speed scaling scheduling of parallel jobs with migration

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2017) 10556 LNCS 351-357
DOI: 10.1007/978-3-319-69404-7_30
2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we consider a problem of preemptive scheduling rigid parallel jobs on speed scalable processors. Each job is specified by its release date, its deadline, its processing volume and the number of processors, which are required for execution of the job. We propose a new strongly polynomial approximation algorithm for the energy minimization problem with migration of jobs.

Author supplied keywords

Cite

CITATION STYLE

APA

Kononov, A., & Kovalenko, Y. (2017). An approximation algorithm for preemptive speed scaling scheduling of parallel jobs with migration. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10556 LNCS, pp. 351–357). Springer Verlag. https://doi.org/10.1007/978-3-319-69404-7_30

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