Comparing algorithm for dynamic speed-setting of a low-power CPU
MobiCom '95 Proceedings of the 1st annual international conference on Mobile computing and networking
The simulation and evaluation of dynamic voltage scaling algorithms
ISLPED '98 Proceedings of the 1998 international symposium on Low power electronics and design
On-line scheduling of hard real-time tasks on variable voltage processor
Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
A survey of design techniques for system-level dynamic power management
IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special section on low-power electronics and design
Real-time dynamic voltage scaling for low-power embedded operating systems
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Vertigo: automatic performance-setting for Linux
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Operating System Modifications for Task-Based Speed and Voltage
Proceedings of the 1st international conference on Mobile systems, applications and services
Policies for dynamic clock scheduling
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
| Hi-index | 0.00 |
The goal of dynamic voltage scaling (DVS) is to reduce CPU energy consumption without degrading applications' quality-of-service (QoS). In general-purpose systems, in which a variety of tasks are scheduled by a traditional dynamic priority-based task scheduler, existing DVS schemes tend to degrade the QoS by causing urgent tasks having low priorities to starve because these schemes ignore the behavior of dynamic priority-based task schedulers. In this paper, we propose the 'double-interval-based DVS scheme for priority-based task scheduling systems (DIP)', which better manages time-sensitive tasks' QoS by bridging the gap between CPU speed scheduling and dynamic priority-based task scheduling. We describe how DIP determines an appropriate CPU speed for a group of coexisting tasks considering tasks' priorities, using an improved interval-based algorithm so that the CPU-time requirements of the low priority time-sensitive tasks in the group can be satisfied. Another novel feature of DIP is that it separates QoS-control from throughput-control via two different interval-based algorithms, which allows more energy savings when throughput is not a primary concern. Trace-based simulations show that, depending upon target systems' primary concern, DIP generally provides better energy savings at comparable QoS or better QoS at comparable energy savings, respectively, compared to existing DVS schemes.