scientific article
From MaRDI portal
Publication:2963934
DOI10.4230/LIPIcs.FSTTCS.2013.449zbMath1359.68034arXiv1403.4991MaRDI QIDQ2963934
Dimitrios Letsios, Giorgio Lucarelli, Alexander V. Kononov, M. I. Sviridenko, Evripidis Bampis
Publication date: 21 February 2017
Full work available at URL: https://arxiv.org/abs/1403.4991
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items
Scheduling on a single machine under time-of-use electricity tariffs ⋮ Throughput maximization in multiprocessor speed-scaling ⋮ A survey of offline algorithms for energy minimization under deadline constraints ⋮ Energy-Efficient Algorithms for Non-preemptive Speed-Scaling ⋮ Throughput Maximization in Multiprocessor Speed-Scaling ⋮ Scheduling on power-heterogeneous processors ⋮ Speed scaling on parallel processors with migration ⋮ Randomized oblivious integral routing for minimizing power cost ⋮ Bayesian generalized network design ⋮ Hardness of Routing for Minimizing Superlinear Polynomial Cost in Directed Graphs ⋮ From preemptive to non-preemptive speed-scaling scheduling ⋮ Race to idle or not: balancing the memory sleep time with DVS for energy minimization ⋮ Unnamed Item
