Online speed scaling based on active job count to minimize flow plus energy

DOI10.1007/s00453-012-9613-yzbMath1272.68470OpenAlexW1985595908WikidataQ58062886 ScholiaQ58062886MaRDI QIDQ2392927

Isaac K. K. To, Lap-Kei Lee, Prudence W. H. Wong, Tak-Wah Lam

Publication date: 5 August 2013

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-012-9613-y

zbMATH Keywords

schedulingcompetitive analysisonline algorithmsflow timeenergy efficiencydynamic speed scalingsleep management

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Energy-efficient multiprocessor scheduling for flow time and makespan

Cites Work

• The bell is ringing in speed-scaled multiprocessor scheduling
• Speed Scaling with an Arbitrary Power Function
• Scheduling for Speed Bounded Processors
• Optimal Power-Down Strategies
• Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
• Nonclairvoyant Speed Scaling for Flow and Energy
• Energy-Efficient Algorithms for Flow Time Minimization
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Online speed scaling based on active job count to minimize flow plus energy