Sleep Management on Multiple Machines for Energy and Flow Time

DOI10.1007/978-3-642-22006-7_19zbMath1332.68292WikidataQ58062932 ScholiaQ58062932MaRDI QIDQ3012808

Lap-Kei Lee, Chi-Man Liu, Sze-Hang Chan, Tak-Wah Lam, Hing-Fung Ting

Publication date: 6 July 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-22006-7_19

Mathematics Subject Classification ID

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

68W27: Online algorithms; streaming algorithms

Related Items

Online Bounded Analysis, Optimizing busy time on parallel machines, Online optimization of busy time on parallel machines, Online-bounded analysis, Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines

Cites Work

• Unnamed Item
• Unnamed Item
• Minimizing total flow time and total completion time with immediate dispatching
• The bell is ringing in speed-scaled multiprocessor scheduling
• Speed Scaling with an Arbitrary Power Function
• Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
• Multi-processor scheduling to minimize flow time with ε resource augmentation
• Scalably Scheduling Power-Heterogeneous Processors
• Sleep with Guilt and Work Faster to Minimize Flow Plus Energy
• Energy-Efficient Algorithms for Flow Time Minimization