Speed scaling for maximum lateness

DOI10.1007/S00224-015-9622-8zbMATH Open1336.68019OpenAlexW2085119474MaRDI QIDQ255271FDOQ255271

Ioannis Milis, Evripidis Bampis, Georgios Zois, Dimitrios Letsios

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Power-aware scheduling for makespan and flow
• Title not available (Why is that?)
• Speed Scaling for Weighted Flow Time
• Title not available (Why is that?)
• Title not available (Why is that?)
• Speed is as powerful as clairvoyance
• Scheduling Parallel Machines On-Line
• Energy-efficient algorithms for flow time minimization
• Getting the best response for your erg
• Speed scaling of tasks with precedence constraints

Cited In (3)

• Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion
• Profit-based latency problems on the line
• Promptness does not imply superlow cuppability

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)