Algorithms for energy conservation in heterogeneous data centers

DOI10.1016/j.tcs.2021.10.009OpenAlexW3188094576MaRDI QIDQ5925533

Jens Quedenfeld, Susanne Albers

Publication date: 18 November 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

lower boundonline algorithmdiscrete settingheterogeneous machines

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• On convex body chasing
• A tight lower bound for online convex optimization with switching costs
• Optimal Power-Down Strategies
• Speed scaling to manage energy and temperature
• An optimal on-line algorithm for metrical task system
• Chasing Nested Convex Bodies Nearly Optimally
• Chasing Convex Bodies Optimally
• Chasing Convex Bodies with Linear Competitive Ratio
• Parallel Machine Scheduling to Minimize Energy Consumption
• Dynamic TCP acknowledgement and other stories about e/(e-1)
• A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs

This page was built for publication: Algorithms for energy conservation in heterogeneous data centers