Approximating the throughput by coolest first scheduling

DOI10.1007/978-3-642-38016-7_16MaRDI QIDQ2848925zbMATH OpenOpenAlexFDO

Authors Ioannis Milis, Julien Robert, Georgios Zois, Christoph Dürr

Publication date 13 September 2013

Published in Approximation and Online Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Temperature Aware Online Scheduling with a Low Cooling Factor
• Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems
• On multiprocessor temperature-aware scheduling problems
• Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
• Temperature aware online algorithms for minimizing flow time

Cited in

(1)

• Temperature aware online algorithms for minimizing flow time

This page was built for publication: Approximating the throughput by coolest first scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848925)