Skip to main content
Conference Proceedings

On speed scaling scheduling of parallel jobs with preemption

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2016) 9869 LNCS 309-321
DOI: 10.1007/978-3-319-44914-2_25
5Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Parallel jobs require more than one processor at the same time.We study speed scaling scheduling of parallel jobs with preemption. We propose “almost-exact” algorithms for problems with rigid jobs and single mode two-processor jobs. Based on configuration linear programs, our algorithms obtain an OPT + ε solution for any fixed ε > 0.

Author supplied keywords

Cite

CITATION STYLE

APA

Kononov, A., & Kovalenko, Y. (2016). On speed scaling scheduling of parallel jobs with preemption. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9869 LNCS, pp. 309–321). Springer Verlag. https://doi.org/10.1007/978-3-319-44914-2_25

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