Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines

DOI10.1016/J.DAM.2014.05.023MaRDI QIDQ401128zbMATH OpenOpenAlexFDO

Authors Eric Angel, Evripidis Bampis, Vincent Chau

Publication date 26 August 2014

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2014.05.023

zbMATH Keywords

schedulingpower managementidentical processorsunit tasks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Low complexity scheduling algorithm minimizing the energy for tasks with agreeable deadlines
• Polynomial Time Algorithms for Minimum Energy Scheduling
• Polynomial-time algorithms for minimum energy scheduling
• A survey of offline algorithms for energy minimization under deadline constraints
• Algorithms for power savings

Cites work

• Polynomial Time Algorithms for Minimum Energy Scheduling
• Scheduling unit tasks to minimize the number of idle periods

Cited in

(8)

• A survey of offline algorithms for energy minimization under deadline constraints
• Scheduling tasks to minimize active time on a processor with unlimited capacity
• Low complexity scheduling algorithm minimizing the energy for tasks with agreeable deadlines
• No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines
• Minimizing energy on homogeneous processors with shared memory
• Scheduling with gaps: new models and algorithms
• Polynomial Time Algorithms for Minimum Energy Scheduling
• Polynomial-time algorithms for minimum energy scheduling

This page was built for publication: Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q401128)