Runtime feasibility check for non-preemptive real-time periodic tasks
Information Processing Letters
Proceedings of the 20th annual conference on Integrated circuits and systems design
Hard real-time tasks' scheduling considering voltage scaling, precedence and exclusion relations
Information Processing Letters
Runtime feasibility check for non-preemptive real-time periodic tasks
Information Processing Letters
Temperature- and energy-constrained scheduling in multitasking systems: a model checking approach
Proceedings of the 16th ACM/IEEE international symposium on Low power electronics and design
Dynamic alteration schemes of real-time schedules for I/O device energy efficiency
ACM Transactions on Embedded Computing Systems (TECS)
Energy- and performance-aware scheduling of tasks on parallel and distributed systems
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Multi-core fixed priority DVS scheduling
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
A heuristic energy-aware approach for hard real-time systems on multi-core platforms
Microprocessors & Microsystems
| Hi-index | 0.01 |
Slowdown based on dynamic voltage scaling (DVS) provides the ability to perform an energy-delay tradeoff in the system. Non-preemptive scheduling becomes an integral part of systems where resource characteristics makes preemption undesirable or impossible. We address the problem of energy efficient scheduling of non-preemptive tasks based on the Earliest Deadline First (EDF) scheduling policy. We present the stack based slowdown algorithm that builds upon the optimal feasibility test for non-preemptive systems. We also propose a dynamic slack reclamation policy to further enhance energy savings. Simulation results show on an average 15% energy savings using static slowdown factors and 20% savings with dynamic slowdown, over known slowdown techniques.