Green scheduling, flows and matchings

DOI10.1007/978-3-642-35261-4_14MaRDI QIDQ4909527zbMATH OpenOpenAlexFDO

Authors Dimitrios Letsios, G. Lucarelli, Evripidis Bampis

Publication date 21 March 2013

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-35261-4_14

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Green scheduling, flows and matchings
• Speed scaling on parallel processors with migration
• Power-aware scheduling for makespan and flow
• Speed scaling on parallel processors with migration
• Energy-efficient algorithms for non-preemptive speed-scaling

Cited in

(11)

• Energy-efficient scheduling and routing via randomized rounding
• Green scheduling, flows and matchings
• Speed scaling on parallel processors with migration
• Throughput maximization in multiprocessor speed-scaling
• A survey of offline algorithms for energy minimization under deadline constraints
• Throughput Maximization in Multiprocessor Speed-Scaling
• Energy efficient scheduling and routing via randomized rounding
• Sustainable operations
• The optimum green split of a cycle time
• From preemptive to non-preemptive speed-scaling scheduling
• From preemptive to non-preemptive speed-scaling scheduling

This page was built for publication: Green scheduling, flows and matchings

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