Skip to main content
Conference Proceedings

Scalably scheduling power-heterogeneous processors

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 6198 LNCS(PART 1) 312-323
DOI: 10.1007/978-3-642-14165-2_27
38Citations
Citations of this article
26Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show that a natural online algorithm for scheduling jobs on a heterogeneous multiprocessor, with arbitrary power functions, is scalable for the objective function of weighted flow plus energy. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Gupta, A., Krishnaswamy, R., & Pruhs, K. (2010). Scalably scheduling power-heterogeneous processors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6198 LNCS, pp. 312–323). https://doi.org/10.1007/978-3-642-14165-2_27

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