Algorithms for Scheduling Imprecise Computations
Computer - Special issue on real-time systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Algorithms for Scheduling Imprecise Computations with Timing Constraints to Minimize Maximum Error
IEEE Transactions on Computers
A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines
IEEE Transactions on Computers
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
A scheduling model for reduced CPU energy
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Skip-Over: algorithms and complexity for overloaded systems that allow skips
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Optimal Reward-Based Scheduling of Periodic Real-Time Tasks
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
ECRTS '01 Proceedings of the 13th Euromicro Conference on Real-Time Systems
Proceedings of the conference on Design, automation and test in Europe
Dynamic and Aggressive Scheduling Techniques for Power-Aware Real-Time Systems
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Maximizing rewards for real-time applications with energy constraints
ACM Transactions on Embedded Computing Systems (TECS)
Reducing both dynamic and leakage energy consumption for hard real-time systems
Proceedings of the 2004 international conference on Compilers, architecture, and synthesis for embedded systems
On-Line Dynamic Voltage Scaling for Hard Real-Time Systems Using the EDF Algorithm
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Voltage Scaling Scheduling for Periodic Real-Time Tasks in Reward Maximization
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
A Hybrid Static/Dynamic DVS Scheduling for Real-Time Systems with (m, k)-Guarantee
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
Energy-Constrained Scheduling for Weakly-Hard Real-Time Systems
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
Maximizing Guaranteed QoS in (m, k)-firm Real-time Systems
RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
IEEE Transactions on Computers
Dynamic voltage scaling under EDF revisited
Real-Time Systems
Power-Aware Scheduling for Multiple Feasible Interval Jobs
RTCSA '09 Proceedings of the 2009 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
| Hi-index | 0.00 |
Time-critical jobs in many real-time applications have more than one feasible interval. Such jobs can be executed in any of their feasible intervals. Given a schedulable set of multiple feasible interval (MFI) jobs, energy can be saved by carefully selecting the executing interval for each job. In this paper, we explore the energy minimization problem for real-time systems in which jobs have more than one feasible interval. The static and dynamic energy management schemes are both investigated to minimize the energy consumption while preserving the system's feasibility. Focusing on EDF scheduling algorithm, we first study reducing the dynamic power consumption of a single CPU. We show that the static optimal speed assignment problem is NP-Hard and propose a simulated annealing (SA) based approach to solve it. Then, we develop several on-line greedy algorithms to exploit run-time slack by reselecting a job's executing interval on-the-fly. In addition, a leakage-aware version is discussed to improve the overall energy efficiency. Simulation results show that all proposed schemes achieve significant improvements of energy efficiency while the system remains schedulable.