Energy efficient scheduling and routing via randomized rounding

DOI10.4230/LIPICS.FSTTCS.2013.449MaRDI QIDQ2963934zbMATH OpenFDO

Authors Alexander Kononov, Dimitrios Letsios, G. Lucarelli, Maxim Sviridenko, Evripidis Bampis

Publication date 21 February 2017

Full work available at URL https://arxiv.org/abs/1403.4991

zbMATH Keywords

approximationschedulingrandomized roundingconfiguration linear programenergy-aware

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Randomized algorithms (68W20) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Recommendations

• Energy-efficient scheduling and routing via randomized rounding
• Approximation algorithms for energy-efficient scheduling of parallel jobs
• Scheduling on power-heterogeneous processors
• Scheduling on power-heterogeneous processors
• Green scheduling, flows and matchings

Cited in

(18)

• Scheduling on a single machine under time-of-use electricity tariffs
• Speed scaling on parallel processors with migration
• From preemptive to non-preemptive speed-scaling scheduling
• Throughput maximization in multiprocessor speed-scaling
• A survey of offline algorithms for energy minimization under deadline constraints
• Energy-efficient scheduling and routing via randomized rounding
• Race to idle or not: balancing the memory sleep time with DVS for energy minimization
• Hallucination helps: energy efficient virtual circuit routing
• Hallucination helps: energy efficient virtual circuit routing
• Multicast routing for energy minimization using speed scaling
• Bayesian generalized network design
• Hardness of routing for minimizing superlinear polynomial cost in directed graphs
• Energy-efficient algorithms for non-preemptive speed-scaling
• Randomized oblivious integral routing for minimizing power cost
• Scheduling on power-heterogeneous processors
• Routing and scheduling for energy and delay minimization in the powerdown model
• Throughput Maximization in Multiprocessor Speed-Scaling
• Bayesian generalized network design

This page was built for publication: Energy efficient scheduling and routing via randomized rounding

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