From preemptive to non-preemptive speed-scaling scheduling
DOI10.1007/978-3-642-38768-5_14zbMATH Open1381.68021OpenAlexW1735147695MaRDI QIDQ4925232FDOQ4925232
Authors: Alexander Kononov, Dimitrios Letsios, G. Lucarelli, Ioannis Nemparis, Evripidis Bampis 
Publication date: 11 June 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38768-5_14
Recommendations
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Title not available (Why is that?)
- Speed scaling of tasks with precedence constraints
- Speed scaling for maximum lateness
- On multi-processor speed scaling with migration
- The bell is ringing in speed-scaled multiprocessor scheduling
- Title not available (Why is that?)
- Speed scaling on parallel processors with migration
- Speed scaling on parallel processors
- Green scheduling, flows and matchings
- An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules
- Non-preemptive Speed Scaling
Cited In (10)
- A fully polynomial-time approximation scheme for speed scaling with a sleep state
- Non-preemptive Speed Scaling
- Non-preemptive speed scaling
- An Exact Algorithm for Non-preemptive Peak Demand Job Scheduling
- Throughput maximization in multiprocessor speed-scaling
- From non-preemptive to preemptive scheduling using synchronization synthesis
- Throughput Maximization in Multiprocessor Speed-Scaling
- New Results for Non-Preemptive Speed Scaling
- Non-preemptive throughput maximization for speed-scaling with power-down
- Energy-Efficient Algorithms for Non-preemptive Speed-Scaling
This page was built for publication: From preemptive to non-preemptive speed-scaling scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4925232)
