Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines
From MaRDI portal
Publication:2343996
DOI10.1007/s10878-013-9618-8zbMath1321.90052OpenAlexW1986783536MaRDI QIDQ2343996
Paul C. Bell, Prudence W. H. Wong
Publication date: 11 May 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://dspace.lboro.ac.uk/2134/18803
multiprocessor schedulingcompetitive analysisonline algorithmsdynamic speed scalingdeadline scheduling
Related Items (3)
Competitive algorithms for demand response management in a smart grid ⋮ Scheduling for electricity cost in a smart grid ⋮ Non-preemptive scheduling in a smart grid model and its implications on machine minimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Speed scaling for stretch plus energy
- Speed scaling on parallel processors
- Deadline scheduling and power management for speed bounded processors
- On multi-processor speed scaling with migration
- The bell is ringing in speed-scaled multiprocessor scheduling
- Non-preemptive Speed Scaling
- Speed Scaling for Maximum Lateness
- Sleep Management on Multiple Machines for Energy and Flow Time
- Scheduling for Speed Bounded Processors
- Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
- Speed scaling to manage energy and temperature
- Speed Scaling for Weighted Flow Time
- Scalably Scheduling Power-Heterogeneous Processors
- Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule
- Sleep with Guilt and Work Faster to Minimize Flow Plus Energy
- Speed Scaling on Parallel Processors with Migration
- Algorithms for power savings
- Energy-efficient algorithms for flow time minimization
- Energy Efficient Deadline Scheduling in Two Processor Systems
- Race to idle
- The Arithmetic of Bell and Stirling Numbers
- Approximation and Online Algorithms
This page was built for publication: Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines
