Temperature aware online algorithms for minimizing flow time

<a class="pub-badge pub-badge--doi" href="https://doi.org/10.1016/J.TCS.2016.10.022" rel="nofollow">DOI 10.1016/J.TCS.2016.10.022</a><a class="pub-badge pub-badge--grey" href="https://zbmath.org/1356.68266" rel="nofollow">zbMATH</a><a class="pub-badge pub-badge--grey" href="https://openalex.org/works/W2553932303" rel="nofollow">OpenAlex</a><a class="pub-badge pub-badge--mardi" href="https://portal.mardi4nfdi.de/wiki/Item:Q501653" rel="nofollow">MaRDI QID Q501653</a><a class="pub-badge pub-badge--grey" href="https://fdo.portal.mardi4nfdi.de/fdo/Q501653" rel="nofollow">FDO</a>

Authors Martin Birks, Stanley P. Y. Fung

Publication date 9 January 2017

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

Full work available at URL https://doi.org/10.1016/j.tcs.2016.10.022

zbMATH Keywords

online algorithmsschedulingtemperatureflow time

Mathematics Subject Classification ID

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

Recommendations

• Temperature aware online algorithms for minimizing flow time
• Temperature Aware Online Scheduling with a Low Cooling Factor
• Temperature aware online algorithms for scheduling equal length jobs
• Temperature aware online algorithms for scheduling equal length jobs
• Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints

Cites work

• scientific article; zbMATH DE number 1559529 (Why is no real title available?)
• Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
• Approximating the throughput by coolest first scheduling
• On multiprocessor temperature-aware scheduling problems
• Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
• Speed is as powerful as clairvoyance
• Temperature aware online algorithms for scheduling equal length jobs

Cited in

(5)

• Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
• STACS 2005
• Temperature aware online algorithms for minimizing flow time
• Approximating the throughput by coolest first scheduling
• Temperature Aware Online Scheduling with a Low Cooling Factor

This page was built for publication: Temperature aware online algorithms for minimizing flow time

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