Temperature aware online algorithms for minimizing flow time
From MaRDI portal
Publication:501653
DOI10.1016/J.TCS.2016.10.022zbMATH Open1356.68266OpenAlexW2553932303MaRDI QIDQ501653FDOQ501653
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
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
Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Speed is as powerful as clairvoyance
- Title not available (Why is that?)
- Temperature aware online algorithms for scheduling equal length jobs
- On multiprocessor temperature-aware scheduling problems
- Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
- Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
- Approximating the Throughput by Coolest First Scheduling
Cited In (3)
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)
