Pages that link to "Item:Q3527206"
From MaRDI portal
The following pages link to Polynomial Time Algorithms for Minimum Energy Scheduling (Q3527206):
Displaying 14 items.
- Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines (Q401128) (← links)
- Speed scaling on parallel processors (Q476431) (← links)
- A model for minimizing active processor time (Q487001) (← links)
- On the NP-hardness of speed scaling with sleep state (Q495994) (← links)
- Approximation algorithms for variable voltage processors: min energy, max throughput and online heuristics (Q553339) (← links)
- A polynomial-time scheduling approach to minimise idle energy consumption: an application to an industrial furnace (Q2027050) (← links)
- Scheduling with gaps: new models and algorithms (Q2059088) (← links)
- Online dynamic power management with hard real-time guarantees (Q2354765) (← links)
- A greedy approximation algorithm for minimum-gap scheduling (Q2400437) (← links)
- Scheduling with Gaps: New Models and Algorithms (Q2947014) (← links)
- Scheduling Tasks to Minimize Active Time on a Processor with Unlimited Capacity (Q2988826) (← links)
- Energy-efficient algorithms for flow time minimization (Q4962689) (← links)
- (Q5743475) (← links)
- Greedy minimum-energy scheduling (Q6574928) (← links)