Online speed scaling based on active job count to minimize flow plus energy
DOI10.1007/S00453-012-9613-YzbMATH Open1272.68470OpenAlexW1985595908WikidataQ58062886 ScholiaQ58062886MaRDI QIDQ2392927FDOQ2392927
Authors: Lap-Kei Lee, Isaac K. K. To, 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
Recommendations
- Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
- Optimizing throughput and energy in online deadline scheduling
- Dynamic speed scaling minimizing expected energy consumption for real-time tasks
- Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion
- Tradeoff between energy and throughput for online deadline scheduling
- Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption
- Online algorithms for non-preemptive speed scaling on power-heterogeneous processors
- New online algorithm for dynamic speed scaling with sleep state
- Robust online speed scaling with deadline uncertainty
- Energy efficient scheduling of parallelizable jobs
online algorithmscompetitive analysisenergy efficiencyschedulingdynamic speed scalingflow timesleep management
Online algorithms; streaming algorithms (68W27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Title not available (Why is that?)
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- Optimal Power-Down Strategies
- Speed scaling for weighted flow time
- Energy-Efficient Algorithms for Flow Time Minimization
- The bell is ringing in speed-scaled multiprocessor scheduling
- Speed scaling with an arbitrary power function
- Title not available (Why is that?)
- Scheduling for Speed Bounded Processors
- Title not available (Why is that?)
- Title not available (Why is that?)
- Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
- Nonclairvoyant speed scaling for flow and energy
Cited In (11)
- Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
- Sleep with Guilt and Work Faster to Minimize Flow Plus Energy
- Energy-efficient multiprocessor scheduling for flow time and makespan
- Energy-Efficient Algorithms for Flow Time Minimization
- Speed scaling for weighted flow time
- Speed scaling for stretch plus energy
- Improved multi-processor scheduling for flow time and energy
- Speed scaling with an arbitrary power function
- Sleep management on multiple machines for energy and flow time
- Scheduling for Speed Bounded Processors
- Getting the best response for your erg
This page was built for publication: Online speed scaling based on active job count to minimize flow plus energy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392927)
