Scheduling for Speed Bounded Processors

DOI10.1007/978-3-540-70575-8_34zbMath1153.68334OpenAlexW2162654297WikidataQ58062984 ScholiaQ58062984MaRDI QIDQ3521936

Lap-Kei Lee, Nikhil Bansal, Ho-Leung Chan, Tak-Wah Lam

Publication date: 28 August 2008

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70575-8_34

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Throughput maximization in multiprocessor speed-scaling ⋮ Energy optimal schedules for jobs with multiple active intervals ⋮ Online speed scaling based on active job count to minimize flow plus energy ⋮ Efficient computation of optimal energy and fractional weighted flow trade-off schedules ⋮ Throughput Maximization in Multiprocessor Speed-Scaling ⋮ On the Complexity of Speed Scaling ⋮ Min-energy scheduling for aligned jobs in accelerate model ⋮ Throughput maximization for speed scaling with agreeable deadlines ⋮ Unnamed Item ⋮ Improved multi-processor scheduling for flow time and energy ⋮ Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines ⋮ Speed scaling for stretch plus energy ⋮ Nonclairvoyant speed scaling for flow and energy ⋮ An $$O(n^2)$$ Algorithm for Computing Optimal Continuous Voltage Schedules ⋮ Energy Efficient Deadline Scheduling in Two Processor Systems ⋮ Speed scaling on parallel processors ⋮ Energy efficient scheduling of parallelizable jobs ⋮ Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines ⋮ Resource cost aware scheduling ⋮ Architecture and robustness tradeoffs in speed-scaled queues with application to energy management ⋮ Speed scaling of processes with arbitrary speedup curves on a multiprocessor ⋮ Deadline scheduling and power management for speed bounded processors ⋮ Best-by-simulations: a framework for comparing efficiency of reconfigurable architectures on workloads with deadlines ⋮ Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan ⋮ Race to idle ⋮ Online dispatching and parallel processing algorithms for saving money in systems with heterogeneous, single-buffered, speed-scalable processors ⋮ Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines ⋮ On multi-processor speed scaling with migration ⋮ DVS scheduling in a line or a star network of processors