Online Algorithms for Maximizing Weighted Throughput of Unit Jobs with Temperature Constraints

DOI10.1007/978-3-642-21204-8_34zbMath1329.90052OpenAlexW2271530151MaRDI QIDQ3004685

No author found.

Publication date: 3 June 2011

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21204-8_34

zbMATH Keywords

schedulingtemperaturecompetitive analysisonline algorithmsresource augmentation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Related Items (2)

On multiprocessor temperature-aware scheduling problems ⋮ Temperature Aware Online Algorithms for Minimizing Flow Time

Cites Work

• Online scheduling with partial job values: does timesharing or randomization help?
• Online competitive algorithms for maximizing weighted throughput of unit jobs
• Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems
• Speed scaling to manage energy and temperature
• Temperature Aware Online Scheduling with a Low Cooling Factor
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Online Algorithms for Maximizing Weighted Throughput of Unit Jobs with Temperature Constraints