Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
From MaRDI portal
Publication:3541124
Recommendations
Cited in
(18)- Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines
- Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines
- Nonclairvoyant speed scaling for flow and energy
- Speed scaling of processes with arbitrary speedup curves on a multiprocessor
- On the complexity of speed scaling
- Architecture and robustness tradeoffs in speed-scaled queues with application to energy management
- Min-energy scheduling for aligned jobs in accelerate model
- Scheduling to minimize energy and flow time in broadcast scheduling
- Speed scaling for stretch plus energy
- Online speed scaling based on active job count to minimize flow plus energy
- Improved multi-processor scheduling for flow time and energy
- Robust online speed scaling with deadline uncertainty
- Nonclairvoyant speed scaling for flow and energy
- The bell is ringing in speed-scaled multiprocessor scheduling
- Efficient computation of optimal energy and fractional weighted flow trade-off schedules
- Deadline scheduling and power management for speed bounded processors
- Sleep management on multiple machines for energy and flow time
- Models and algorithms for energy-efficient scheduling with immediate start of jobs
This page was built for publication: Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3541124)