Access the full text.
Sign up today, get DeepDyve free for 14 days.
S. Sahni (1976)
Algorithms for Scheduling Independent TasksJournal of the ACM (JACM), 23
Yamada, T. Iizuka, Ishiuchi, K. Sawada (2004)
Alpha-Power Law MOSFET Model and its Applications to CMOS Inverter Delay and Other Formulas
F. Yao, A. Demers, S. Shenker (1995)
A scheduling model for reduced CPU energyProceedings of IEEE 36th Annual Foundations of Computer Science
T. Sakurai, A. Newton (1990)
Alpha-power law MOSFET model and its applications to CMOS inverter delay and other formulasIEEE Journal of Solid-state Circuits, 25
P. Pillai, K. Shin (2001)
Real-time dynamic voltage scaling for low-power embedded operating systemsProceedings of the eighteenth ACM symposium on Operating systems principles
C. Locke, D. Vogel, T. Mesler (1991)
Building a predictable avionics platform in Ada: a case study[1991] Proceedings Twelfth Real-Time Systems Symposium
Inki Hong, G. Qu, M. Potkonjak, M. Srivastava (1998)
Synthesis techniques for low-power hard real-time systems on variable voltage processorsProceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279)
G. Woeginger (1999)
When does a dynamic programming formulation guarantee the existence of an FPTAS?Electron. Colloquium Comput. Complex., TR01
Woonseok Kim, Jihong Kim, S. Min (2002)
Dynamic voltage scaling algorithm for dynamic-priority hard real-time systems using slack time analysisProceedings 2002 Design, Automation and Test in Europe Conference and Exhibition
Hakan Aydin, Pedro Mejía-Alvarez, D. Mossé, R. Melhem (2001)
Dynamic and aggressive scheduling techniques for power-aware real-time systemsProceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420)
F. Gruian (2001)
Hard real-time scheduling for low-energy using stochastic data and DVS processorsISLPED'01: Proceedings of the 2001 International Symposium on Low Power Electronics and Design (IEEE Cat. No.01TH8581)
Youngsoo Shin, Kiyoung Choi, T. Sakurai (2000)
Power optimization of real-time embedded systems on variable speed processorsIEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140)
Youngsoo Shin, Kiyoung Choi (1999)
Power conscious fixed priority scheduling for hard real-time systemsProceedings 1999 Design Automation Conference (Cat. No. 99CH36361)
Dongkun Shin, Jihong Kim, Seongsoo Lee (2001)
Low-energy intra-task voltage scheduling using static timing analysisProceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232)
(2002)
Received March
David Johnson (1982)
The NP-Completeness Column: An Ongoing GuideJ. Algorithms, 4
Namyun Kim, Minsoo Ryu, Seongsoo Hong, M. Saksena, Chong-Ho Choi, Heonshik Shin (1996)
Visual assessment of a real-time system design: a case study on a CNC controller17th IEEE Real-Time Systems Symposium
Gang Quan, X. Hu (2001)
Energy efficient fixed-priority scheduling for real-time systems on variable voltage processorsProceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232)
M. Garey (1979)
Johnson: computers and intractability: a guide to the theory of np- completeness (freeman
(1973)
Real-time systems
We address the problem of energy-optimal voltage scheduling for fixed-priority hard real-time systems, on which we present a complete treatment both theoretically and practically. Although most practical real-time systems are based on fixed-priority scheduling, there have been few research results known on the energy-optimal fixed-priority scheduling problem. First, we prove that the problem is NP-hard. Then, we present a fully polynomial time approximation scheme (FPTAS) for the problem. For any ϵ > 0, the proposed approximation scheme computes a voltage schedule whose energy consumption is at most (1 + ϵ) times that of the optimal voltage schedule. Furthermore, the running time of the proposed approximation scheme is bounded by a polynomial function of the number of input jobs and 1/ϵ. Given the NP-hardness of the problem, the proposed approximation scheme is practically the best solution because it can compute a near-optimal voltage schedule (i.e., provably arbitrarily close to the optimal schedule) in polynomial time. Experimental results show that the approximation scheme finds more efficient (almost optimal) voltage schedules faster than the best existing heuristic.
ACM Transactions on Embedded Computing Systems (TECS) – Association for Computing Machinery
Published: Aug 1, 2003
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.