Scalably scheduling power-heterogeneous processors

Anupam Gupta; Ravishankar Krishnaswamy; Kirk Pruhs

doi:10.1007/978-3-642-14165-2_27

Scalably scheduling power-heterogeneous processors

Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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.

Original language	English (US)
Title of host publication	Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings
Pages	312-323
Number of pages	12
Edition	PART 1
DOIs	https://doi.org/10.1007/978-3-642-14165-2_27
State	Published - 2010
Event	37th International Colloquium on Automata, Languages and Programming, ICALP 2010 - Bordeaux, France Duration: Jul 6 2010 → Jul 10 2010

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 1
Volume	6198 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	37th International Colloquium on Automata, Languages and Programming, ICALP 2010
Country/Territory	France
City	Bordeaux
Period	7/6/10 → 7/10/10

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-14165-2_27

Cite this

Gupta, A., Krishnaswamy, R., & Pruhs, K. (2010). Scalably scheduling power-heterogeneous processors. In Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings (PART 1 ed., pp. 312-323). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6198 LNCS, No. PART 1). https://doi.org/10.1007/978-3-642-14165-2_27

Scalably scheduling power-heterogeneous processors. / Gupta, Anupam; Krishnaswamy, Ravishankar; Pruhs, Kirk.
Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings. PART 1. ed. 2010. p. 312-323 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6198 LNCS, No. PART 1).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Gupta, A, Krishnaswamy, R & Pruhs, K 2010, Scalably scheduling power-heterogeneous processors. in Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings. PART 1 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 1, vol. 6198 LNCS, pp. 312-323, 37th International Colloquium on Automata, Languages and Programming, ICALP 2010, Bordeaux, France, 7/6/10. https://doi.org/10.1007/978-3-642-14165-2_27

Gupta A, Krishnaswamy R, Pruhs K. Scalably scheduling power-heterogeneous processors. In Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings. PART 1 ed. 2010. p. 312-323. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1). doi: 10.1007/978-3-642-14165-2_27

Gupta, Anupam ; Krishnaswamy, Ravishankar ; Pruhs, Kirk. / Scalably scheduling power-heterogeneous processors. Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings. PART 1. ed. 2010. pp. 312-323 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1).

@inproceedings{c30aed4cd9c54b909a6830f60c08d7d5,

title = "Scalably scheduling power-heterogeneous processors",

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.",

author = "Anupam Gupta and Ravishankar Krishnaswamy and Kirk Pruhs",

year = "2010",

doi = "10.1007/978-3-642-14165-2_27",

language = "English (US)",

isbn = "3642141641",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

number = "PART 1",

pages = "312--323",

booktitle = "Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings",

edition = "PART 1",

note = "37th International Colloquium on Automata, Languages and Programming, ICALP 2010 ; Conference date: 06-07-2010 Through 10-07-2010",

}

TY - GEN

T1 - Scalably scheduling power-heterogeneous processors

AU - Gupta, Anupam

AU - Krishnaswamy, Ravishankar

AU - Pruhs, Kirk

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=77955333477&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77955333477&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-14165-2_27

DO - 10.1007/978-3-642-14165-2_27

M3 - Conference contribution

AN - SCOPUS:77955333477

SN - 3642141641

SN - 9783642141645

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 312

EP - 323

BT - Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings

T2 - 37th International Colloquium on Automata, Languages and Programming, ICALP 2010

Y2 - 6 July 2010 through 10 July 2010

ER -

Scalably scheduling power-heterogeneous processors

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this