Non-preemptive speed scaling

DOI10.1007/s10951-013-0312-6zbMath1297.68036OpenAlexW2041438374MaRDI QIDQ398859

Chien-Chung Huang, Antonios Foivos Antoniadis

Publication date: 18 August 2014

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

Full work available at URL: https://doi.org/10.1007/s10951-013-0312-6

zbMATH Keywords

approximation algorithmsenergy-efficient schedulingnon-preemption

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (12)

Scheduling on a single machine under time-of-use electricity tariffs ⋮ Throughput maximization in multiprocessor speed-scaling ⋮ A survey of offline algorithms for energy minimization under deadline constraints ⋮ Energy-Efficient Algorithms for Non-preemptive Speed-Scaling ⋮ Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems ⋮ Inverse interval scheduling via reduction on a single machine ⋮ Throughput Maximization in Multiprocessor Speed-Scaling ⋮ Scheduling on power-heterogeneous processors ⋮ Exploring a Resolution Method Based on an Evolutionary Game-Theoretical Model for Minimizing the Machines with Limited Workload Capacity and Interval Constraints ⋮ Online interval scheduling with a bounded number of failures ⋮ Approximation algorithms for energy-efficient scheduling of parallel jobs ⋮ Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Min-energy voltage allocation for tree-structured tasks
• Speed Scaling for Maximum Lateness
• Speed scaling to manage energy and temperature
• Convex programming for scheduling unrelated parallel machines
• On the Value of Preemption in Scheduling
• Resource Minimization Job Scheduling
• Parallel Processor Scheduling with Limited Number of Preemptions
• From Preemptive to Non-preemptive Speed-Scaling Scheduling
• Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
• Algorithms and Data Structures
• An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules

This page was built for publication: Non-preemptive speed scaling