Scalably Scheduling Power-Heterogeneous Processors

DOI10.1007/978-3-642-14165-2_27MaRDI QIDQ3587388zbMATH OpenOpenAlexFDO

Authors Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs

Publication date 7 September 2010

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1105.3748

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)

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.

Cited in

(14)

• Scheduling on power-heterogeneous processors
• Energy efficient scheduling of parallelizable jobs
• Scheduling to minimize energy and flow time in broadcast scheduling
• Approximation algorithms for energy-efficient scheduling of parallel jobs
• Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines
• Energy-Aware Scheduling on Heterogeneous Processors
• Sleep management on multiple machines for energy and flow time
• Speed scaling for stretch plus energy
• scientific article; zbMATH DE number 2017348 (Why is no real title available?)
• Within-Die Variation-Aware Scheduling in Superscalar Processors for Improved Throughput
• Machine speed scaling by adapting methods for convex optimization with submodular constraints
• Resource augmentation for weighted flow-time explained by dual fitting
• Scheduling heterogeneous processors isn't as easy as you think
• Time-constrained energy minimization for online execution of a stochastic DAG task

This page was built for publication: Scalably Scheduling Power-Heterogeneous Processors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3587388)