Han-Saem Yun
Abstract
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.
- Aydin, H., Melhem, R., Mosse, D., and Alvarez, P. M. 2001. Dynamic and aggressive scheduling techniques for power-aware real-time systems. In Proceedings of Real-Time Systems Symposium. Google Scholar
- Garey, M. and Johnson, D. 1979. Computers and Intractability. W.H. Freeman and Company: San Francisco, CA. Google Scholar
- Gruian, F. 2001. Hard real-time scheduling for low-energy using stochastic data and DVS processors. In Proceedings of International Symposium on Low Power Electronics and Design, 46--51. Google Scholar
- Hong, I., Qu, G., Potkonjak, M., and Srivastava, M. B. 1998. Synthesis techniques for low-power hard real-time systems on variable voltage processors. In Proceedings of Real-Time Systems Symposium, 178--187. Google Scholar
- Kim, W., Kim, J., and Min, S. L. 2002. A dynamic voltage scaling algorithm for dynamic-priority hard real-time systems using slack time analysis. In Proceedings of Design, Automation and Test in Europe. Google Scholar
- Kim, N., Ryu, M., Hong, S., Saksena, M., Choi, C., and Shin, H. 1996. Visual assessment of a real-time system design: A case study on a CNC controller. In Proceedings of Real-Time Systems Symposium, 300--310. Google Scholar
- Liu, W.-S. 2000. Real-Time Systems. Prentice Hall, Englewood, Cliffs, NJ. Google Scholar
- Locke, C., Vogel, D., and Mesler, T. 1991. Building a predictable avionics platform in Ada: A case study. In Proceedings of Real-Time Systems Symposium.Google Scholar
- Pillai, P. and Shin, K. G. 2001. Real-time dynamic voltage scaling for low-power embedded operating systems. In Proceedings of ACM Symposium on Operating Systems Principles. Google Scholar
- Quan, G. and Hu, X. 2001. Energy efficient fixed-priority scheduling for real-time systems on variable voltage processors. In Proceedings of Design Automatioin Conference, 828--833. Google Scholar
- Quan, G. and Hu, X. 2002. An optimal voltage schedule for real-time systems on a variable voltage processor. In Proceedings of Design, Automation and Test in Europe. Google Scholar
- Sahni, S. 1976. Algorithms for scheduling independent tasks. J. ACM 23, 116--127. Google Scholar
- Sakurai, T. and Newton, A. 1990. Alpha-power law MOSFET model and its application to CMOS inverter delay and other formulars. IEEE Journal of Solid State Circuits 25, 2, 584--594.Google Scholar
- Shin, D., Kim, J., and Lee, S. 2001. Low-energy intra-task voltage scheduling using static timing analysis. In Proceedings of the 38th Design Automation Conference. Google Scholar
- Shin, Y. and Choi, K. 1999. Power conscious fixed priority scheduling for hard real-time systems. In Proceedings of Design Automatioin Conference, 134--139. Google Scholar
- Shin, Y., Choi, K., and Sakurai, T. 2000. Power optimization of real-time embedded systems on variable speed processors. In Proceedings of International Conference on Computer-Aided Design, 365--368. Google Scholar
- Woeginger, G. J. 1999. When does a dynamic programming formulation guarantee the existence of an FPTAS? In Proceedings of ACM-SIAM Symposium on Discrete Algorithms, 820--829. Google Scholar
- Yao, F., Demers, A., and Shenker, S. 1995. A scheduling model for reduced CPU energy. In Proceedings of IEEE Annual Foundations of Computer Science, 374--382. Google Scholar
Index Terms
- On energy-optimal voltage scheduling for fixed-priority hard real-time systems
Recommendations
Preference-oriented fixed-priority scheduling for periodic real-time tasks
A preference priority assignment (PPA) scheme that explicitly incorporates the ASAP and ALAP execution preferences of periodic real-time tasks is proposed.An online dual-queue based preference-oriented fixed- priority (POFP) scheduler is proposed 4, ...
Optimal Utilization Bounds for the Fixed-Priority Scheduling of Periodic Task Systems on Identical Multiprocessors
Abstract--In fixed-priority scheduling, the priority of a job, once assigned, may not change. A new fixed-priority algorthm for scheduling systems of periodic tasks upon identical multiprocessors is proposed. This algorithm has an achievable utilization ...
Reward-based voltage scheduling for dynamic-priority hard real-time systems
Reward-based scheduling has been investigated for flexible applications in which an approximate but timely result is acceptable. Meanwhile, significant research efforts have been made on voltage scheduling which exploits the tradeoff between the ...
Comments