Profit-driven uniprocessor scheduling with energy and timing constraints

Authors:
Jian-Jia Chen;Tei-Wei Kuo;Chia-Lin Yang
Affiliations:
National Taiwan University, Taipei, Taiwan, ROC;National Taiwan University, Taipei, Taiwan, ROC;National Taiwan University, Taipei, Taiwan, ROC
Venue:
Proceedings of the 2004 ACM symposium on Applied computing
Year:
2004

Citing 12
Cited 5

Voltage scheduling problem for dynamically variable voltage processors

ISLPED '98 Proceedings of the 1998 international symposium on Low power electronics and design
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

Journal of the ACM (JACM)
Considering power variations of DVS processing elements for energy minimisation in distributed systems

Proceedings of the 14th international symposium on Systems synthesis
Approximation algorithms

Approximation algorithms
Scientific Computing and Differential Equations: An Introduction to Numerical Methods

Scientific Computing and Differential Equations: An Introduction to Numerical Methods
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
What is the limit of energy saving by dynamic voltage scaling?

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Algorithms for power savings

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A scheduling model for reduced CPU energy

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Maximizing the System Value while Satisfying Time and Energy Constraints

RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
Competitive Analysis of Dynamic Power Management Strategies for Systems with Multiple Power Savings States

Proceedings of the conference on Design, automation and test in Europe
Scheduling with Dynamic Voltage/Speed Adjustment Using Slack Reclamation in Multi-Processor Real-Time Systems

RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium

An Approximation Algorithm for Energy-Efficient Scheduling on A Chip Multiprocessor

Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Procrastination for leakage-aware rate-monotonic scheduling on a dynamic voltage scaling processor

Proceedings of the 2006 ACM SIGPLAN/SIGBED conference on Language, compilers, and tool support for embedded systems
Getting the best response for your erg

ACM Transactions on Algorithms (TALG)
Maximizing job benefits on multiprocessor systems using a greedy algorithm

ACM SIGBED Review - Special issue on the the 14th IEEE real-time and embedded technology and applications symposium (RTAS'08) WIP session
Power-saving scheduling for weakly dynamic voltage scaling devices

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

Energy-aware scheduling has received much attention in recent years, especially for systems with serious considerations on energy consumption. While most previous work focuses on the minimization of energy consumption, this paper exploits the maximization of the entire system profit under energy and timing constraints. We propose a greedy approximation algorithm with a 2-approximation ratio. A fully polynomial time approximation scheme (FPTAS) is also proposed, which is an optimal approximation algorithm unless P = NP. For each specified amount of error tolerant to users, the approximation algorithm could provide trade-offs among the specified error, the running time, the approximation ratio, and the memory space complexity. It provides ways for system engineers to trade performance with implementation constraints.