Speed scaling on parallel processors
From MaRDI portal
Publication:476431
DOI10.1007/s00453-012-9678-7zbMath1317.68020OpenAlexW1984630032MaRDI QIDQ476431
Susanne Albers, Swen Schmelzer, Fabian Müller
Publication date: 2 December 2014
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-012-9678-7
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)
Related Items (24)
Energy-efficient scheduling and routing via randomized rounding ⋮ 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 ⋮ Sustainable operations ⋮ Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion ⋮ Throughput Maximization in Multiprocessor Speed-Scaling ⋮ Scheduling on power-heterogeneous processors ⋮ Speed scaling on parallel processors with migration ⋮ Bi-objective speed-scaling robotic cell scheduling with peak power consumption constraint ⋮ Unnamed Item ⋮ Approximation algorithms for energy-efficient scheduling of parallel jobs ⋮ Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints ⋮ Energy Efficient Deadline Scheduling in Two Processor Systems ⋮ Race to idle or not: balancing the memory sleep time with DVS for energy minimization ⋮ From Preemptive to Non-preemptive Speed-Scaling Scheduling ⋮ Average rate speed scaling ⋮ Deadline scheduling and power management for speed bounded processors ⋮ Minimizing energy on homogeneous processors with shared memory ⋮ Models and algorithms for energy-efficient scheduling with immediate start of jobs ⋮ Speed scaling with a solar cell ⋮ Power-aware scheduling for makespan and flow ⋮ Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines ⋮ On multi-processor speed scaling with migration
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Average rate speed scaling
- Speed scaling of tasks with precedence constraints
- Power-aware scheduling for makespan and flow
- Improved multi-processor scheduling for flow time and energy
- Scheduling to minimize gaps and power consumption
- The bell is ringing in speed-scaled multiprocessor scheduling
- Optimizing throughput and energy in online deadline scheduling
- Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines
- Scheduling for Speed Bounded Processors
- Polynomial Time Algorithms for Minimum Energy Scheduling
- Speed scaling to manage energy and temperature
- Scheduling unit tasks to minimize the number of idle periods
- Speed Scaling for Weighted Flow Time
- Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule
- Algorithms for power savings
- Energy-efficient algorithms for flow time minimization
- Energy Efficient Deadline Scheduling in Two Processor Systems
- Algorithms and Data Structures
This page was built for publication: Speed scaling on parallel processors
