Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
DOI10.1007/978-3-540-87744-8_54zbMATH Open1158.68347OpenAlexW1563048602MaRDI QIDQ3541124FDOQ3541124
Authors: Lap-Kei Lee, Isaac K. K. To, Prudence W. H. Wong, Tak-Wah Lam 
Publication date: 25 November 2008
Published in: Algorithms - ESA 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87744-8_54
Recommendations
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
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
- Title not available (Why is that?)
- Architecture and robustness tradeoffs in speed-scaled queues with application to energy management
- Scheduling to minimize energy and flow time in broadcast scheduling
- Min-energy scheduling for aligned jobs in accelerate model
- Speed scaling for stretch plus energy
- On the Complexity of Speed Scaling
- Online speed scaling based on active job count to minimize flow plus energy
- Improved multi-processor scheduling for flow time and energy
- 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)
