Throughput maximization for speed scaling with agreeable deadlines

DOI10.1007/S10951-015-0452-YzbMath1386.90043OpenAlexW2200004859MaRDI QIDQ1702723

Evripidis Bampis, Eric Angel, Vincent Chau, Dimitrios Letsios

Publication date: 28 February 2018

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-015-0452-y

zbMATH Keywords

schedulingthroughputspeed scaling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for variable voltage processors: min energy, max throughput and online heuristics
• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
• Tradeoff between Energy and Throughput for Online Deadline Scheduling
• Scheduling for Speed Bounded Processors
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Getting the best response for your erg
• Energy Efficient Deadline Scheduling in Two Processor Systems
• Online Deadline Scheduling with Bounded Energy Efficiency
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

This page was built for publication: Throughput maximization for speed scaling with agreeable deadlines