Voltage scheduling problem for dynamically variable voltage processors
ISLPED '98 Proceedings of the 1998 international symposium on Low power electronics and design
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Leakage aware dynamic voltage scaling for real-time embedded systems
Proceedings of the 41st annual Design Automation Conference
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
Dynamic slack reclamation with procrastination scheduling in real-time embedded systems
Proceedings of the 42nd annual Design Automation Conference
Energy-efficient policies for embedded clusters
LCTES '05 Proceedings of the 2005 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
Reliability-Aware Dynamic Energy Management in Dependable Embedded Real-Time Systems
RTAS '06 Proceedings of the 12th IEEE Real-Time and Embedded Technology and Applications Symposium
Leakage-Aware Energy-Efficient Scheduling of Real-Time Tasks in Multiprocessor Systems
RTAS '06 Proceedings of the 12th IEEE Real-Time and Embedded Technology and Applications Symposium
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
ECRTS '08 Proceedings of the 2008 Euromicro Conference on Real-Time Systems
Leakage-aware multiprocessor scheduling for low power
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
CODES+ISSS '11 Proceedings of the seventh IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Energy-aware real-time task synchronization in multi-core embedded systems
Proceedings of the 28th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |
Low-power and energy-efficient system implementations have become very important design issues to extend operation duration or cut power bills. To balance the energy consumption resulting from the dynamic power consumption and the static power consumption, the concept of critical speed has been adopted widely in the literature. Most scheduling algorithms for such systems assume that the critical speed is the lowest speed for scheduling and then perform job/task procrastination to turn the processor(s) to the dormant mode when there is no job for execution. This paper shows that the critical speed might be too optimistic and turning the processor(s) to the dormant mode might be energy-inefficient. By allowing tasks to run at lower speeds than the critical speed, in this paper, a new approximation algorithm is developed for homogeneous multiprocessor systems with a 1.21-approximation factor, which significantly improves the state-of-the-art approximation algorithm with a 1.667-approximation factor. Performance evaluation shows the effectiveness of the proposed algorithm with comparison to the state-of-the-art approximation algorithm. Our algorithm can reduce the energy consumption by at most 15% in our simulations.