Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule

DOI10.1007/978-3-642-02927-1_14zbMath1248.68107OpenAlexW1925374724MaRDI QIDQ3638031

No author found.

Publication date: 14 July 2009

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

Full work available at URL: https://research.tue.nl/nl/publications/cb733897-0982-477a-b7f6-1bcb747c97bc

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (14)

Unnamed Item ⋮ The bell is ringing in speed-scaled multiprocessor scheduling ⋮ Speed scaling on parallel processors ⋮ On the NP-hardness of speed scaling with sleep state ⋮ New online algorithm for dynamic speed scaling with sleep state ⋮ Energy efficient scheduling of parallelizable jobs ⋮ Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines ⋮ Average rate speed scaling ⋮ Deadline scheduling and power management for speed bounded processors ⋮ A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting ⋮ Multi-Priority Online Scheduling with Cancellations ⋮ Speed scaling with a solar cell ⋮ Unnamed Item ⋮ Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines

This page was built for publication: Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule