Trade-offs between voltage scaling and processor shutdown for low-energy embedded multiprocessors

Authors:
Pepijn de Langen;Ben Juurlink
Affiliations:
Delft University of Technology, Computer Engineering Lab, Delft, The Netherlands;Delft University of Technology, Computer Engineering Lab, Delft, The Netherlands
Venue:
SAMOS'07 Proceedings of the 7th international conference on Embedded computer systems: architectures, modeling, and simulation
Year:
2007

Citing 14
Cited 5

LEneS: task scheduling for low-energy systems using variable supply voltage processors

Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Task scheduling and voltage selection for energy minimization

Proceedings of the 39th annual Design Automation Conference
Design Challenges of Technology Scaling

IEEE Micro
Algorithms for power savings

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Combined dynamic voltage scaling and adaptive body biasing for lower power microprocessors under dynamic workloads

Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Scheduling with Dynamic Voltage/Speed Adjustment Using Slack Reclamation in Multiprocessor Real-Time Systems

IEEE Transactions on Parallel and Distributed Systems
Overhead-Conscious Voltage Selection for Dynamic and Leakage Energy Reduction of Time-Constrained Systems

Proceedings of the conference on Design, automation and test in Europe - Volume 1
Leakage aware dynamic voltage scaling for real-time embedded systems

Proceedings of the 41st annual Design Automation Conference
Combined Dynamic Voltage Scaling and Adaptive Body Biasing for Heterogeneous Distributed Real-time Embedded Systems

Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Communication-Aware Task Scheduling and Voltage Selection for Total Systems Energy Minimization

Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Fixed Priority Scheduling for Reducing Overall Energy on Variable Voltage Processors

RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Power Efficient Processor Architecture and The Cell Processor

HPCA '05 Proceedings of the 11th International Symposium on High-Performance Computer Architecture
Energy-efficient policies for embedded clusters

LCTES '05 Proceedings of the 2005 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
Leakage-aware multiprocessor scheduling for low power

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing

Leakage-Aware Multiprocessor Scheduling

Journal of Signal Processing Systems
Linear Combinations of DVFS-Enabled Processor Frequencies to Modify the Energy-Aware Scheduling Algorithms

CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
FAWNdamentally power-efficient clusters

HotOS'09 Proceedings of the 12th conference on Hot topics in operating systems
Some observations on optimal frequency selection in DVFS-based energy consumption minimization

Journal of Parallel and Distributed Computing
Comparison of scheduling schemes for on-demand IaaS requests

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

When peak performance is unnecessary, Dynamic Voltage Scaling (DVS) can be used to reduce the dynamic power consumption of embedded multiprocessors. In future technologies, however, static power consumption is expected to increase significantly. Then it will be more effective to limit the number of employed processors, and use a combination of DVS and processor shutdown. Scheduling heuristics are presented that determine the best trade-off between these three techniques: DVS, processor shutdown, and finding the optimal number of processors. Experimental results show that our approach reduces the total energy consumption by up to 25% for tight deadlines and by up to 57% for loose deadlines compared to DVS.We also compare the energy consumed by our scheduling algorithm to two lower bounds, and show that our best approach leaves little room for improvement.