Speed scaling for maximum lateness

DOI10.1007/S00224-015-9622-8MaRDI QIDQ255271zbMATH OpenOpenAlexFDO

Authors Dimitrios Letsios, Ioannis Milis, Georgios Zois, Evripidis Bampis

Publication date 9 March 2016

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-015-9622-8

zbMATH Keywords

energy efficiencymaximum latenessschedulingspeed scaling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Speed scaling for maximum lateness
• Non-preemptive throughput maximization for speed-scaling with power-down
• Throughput maximization for speed scaling with agreeable deadlines
• Throughput maximization for speed-scaling with agreeable deadlines
• Speed scaling on parallel processors with migration

Cites work

• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1306870 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• Algorithms for dynamic speed scaling
• Energy-efficient algorithms for flow time minimization
• Getting the best response for your erg
• Power-aware scheduling for makespan and flow
• Scheduling Parallel Machines On-Line
• Speed is as powerful as clairvoyance
• Speed scaling for weighted flow time
• Speed scaling of tasks with precedence constraints

Cited in

(5)

• Speed scaling for maximum lateness
• Promptness does not imply superlow cuppability
• Profit-based latency problems on the line
• Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion
• Robust online speed scaling with deadline uncertainty

This page was built for publication: Speed scaling for maximum lateness

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