Energy Efficient Deadline Scheduling in Two Processor Systems
From MaRDI portal
Recommendations
Cites work
- Energy-Efficient Algorithms for Flow Time Minimization
- scientific article; zbMATH DE number 6381709 (Why is no real title available?)
- scientific article; zbMATH DE number 1306870 (Why is no real title available?)
- MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling
- Scheduling for Speed Bounded Processors
- Speed scaling for weighted flow time
- Speed scaling on parallel processors
- Speed scaling to manage energy and temperature
Cited in
(14)- Energy-efficient real-time scheduling for two-type heterogeneous multiprocessors
- Throughput maximization for speed scaling with agreeable deadlines
- Energy efficient scheduling of parallelizable jobs
- Best-by-simulations: a framework for comparing efficiency of reconfigurable architectures on workloads with deadlines
- 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
- The bell is ringing in speed-scaled multiprocessor scheduling
- scientific article; zbMATH DE number 6381709 (Why is no real title available?)
- An O(n^2) algorithm for computing optimal continuous voltage schedules
- Energy-efficient deadline scheduling for heterogeneous systems
- Speed scaling on parallel processors
- Min-energy scheduling for aligned jobs in accelerate model
- Deadline scheduling and power management for speed bounded processors
This page was built for publication: Energy Efficient Deadline Scheduling in Two Processor Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387780)