From preemptive to non-preemptive speed-scaling scheduling
From MaRDI portal
Publication:4925232
Recommendations
Cites work
- scientific article; zbMATH DE number 6381709 (Why is no real title available?)
- scientific article; zbMATH DE number 1306870 (Why is no real title available?)
- An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules
- Green scheduling, flows and matchings
- Non-preemptive Speed Scaling
- On multi-processor speed scaling with migration
- Speed scaling for maximum lateness
- Speed scaling of tasks with precedence constraints
- Speed scaling on parallel processors
- Speed scaling on parallel processors with migration
- The bell is ringing in speed-scaled multiprocessor scheduling
Cited in
(12)- Non-preemptive speed scaling
- Throughput Maximization in Multiprocessor Speed-Scaling
- Non-preemptive throughput maximization for speed-scaling with power-down
- Throughput maximization in multiprocessor speed-scaling
- An exact algorithm for non-preemptive peak demand job scheduling
- A fully polynomial-time approximation scheme for speed scaling with a sleep state
- From non-preemptive to preemptive scheduling using synchronization synthesis
- Energy-efficient algorithms for non-preemptive speed-scaling
- From preemptive to non-preemptive speed-scaling scheduling
- Speed-scaling with no preemptions
- New Results for Non-Preemptive Speed Scaling
- 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)