01.02.2013 Views

An Efficient Lyapunov Equation-Based Approach for ... - Lirmm

An Efficient Lyapunov Equation-Based Approach for ... - Lirmm

An Efficient Lyapunov Equation-Based Approach for ... - Lirmm

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

DAC'99, pages 134-139<br />

Power Conscious Fixed Priority Scheduling <strong>for</strong> Hard Real-Time Systems<br />

Youngsoo Shin and Kiyoung Choi<br />

School of Electrical Engineering, Seoul National University, Seoul 151-742, Korea<br />

Abstract<br />

Power efficient design of real-time systems based on programmable processors becomes more<br />

important as system functionality is increasingly realized through software. This paper presents a<br />

power-efficient version of a widely used fixed priority scheduling method. The method yields a<br />

power reduction by exploiting slack times, both those inherent in the system schedule and those<br />

arising from variations of execution times. The proposed run-time mechanism is simple enough<br />

to be implemented in most kernels. Experimental results show that the proposed scheduling<br />

method obtains a significant power reduction across several kinds of applications.<br />

References<br />

[1] C. L. Liu and J. W. Layland, “Scheduling algorithms <strong>for</strong> multiprogramming in a hard real time environment,” J.<br />

ACM, vol. 20, pp. 46–61, Jan. 1973.<br />

[2] J. Lehoczky, L. Sha, and Y. Ding, “The rate monotonic scheduling algorithm: exact characterization and average<br />

case behavior,” in Proc. IEEE Real-Time Systems Symposium, pp. 166–171, Dec. 1989.<br />

[3] M. Joseph and P. Pandya, “Finding response times in a real-time system,” The Computer J., vol. 29, pp. 390–<br />

395, Oct. 1986.<br />

[4] N. Audsley, A. Burns,M. Richardson, and A.Wellings, “Hard real-time scheduling: The deadline-monotonic<br />

approach,” in Proc. IEEE Workshop on Real-Time Operating Systems and Software, pp. 133–137, May 1991.<br />

[5] C. Park and A. C. Shaw, “Experiments with a program timing tool based on source-level timing schema,” IEEE<br />

Computer, pp. 48–57, May 1991.<br />

[6] S. Lim, Y. Bae, G. Jang, B. Rhee, S. Min, C. Park, H. Shin, K. Park, and C. Kim, “<strong>An</strong> accurate worst case timing<br />

analysis <strong>for</strong> RISC processors,” in Proc. IEEE Real-Time Systems Symposium, pp. 97–108, Dec. 1994.<br />

[7] Y. S. Li, S. Malik, and A. Wolfe, “Per<strong>for</strong>mance estimation of embedded software with instruction cache<br />

modeling,” in Proc. Int’l Conf. on Computer Aided Design, pp. 380–387, Nov. 1995.<br />

[8] R. Ernst and W. Ye, “Embedded program timing analysis based on path clustering and architecture<br />

classification,” in Proc. Int’l Conf. on Computer Aided Design, pp. 598–604, Nov. 1997.<br />

[9] S. Gary, “PowerPC: A microprocessor <strong>for</strong> portable computers,” IEEE Design & Test of Computers, pp. 14–23,<br />

Dec. 1994.<br />

[10] M. B. Srivastava, A. P. Chandrakasan, and R. W. Brodersen, “Predictive system shutdown and other<br />

architectural techniques <strong>for</strong> energy efficient programmable computation,” IEEE Trans. on VLSI Systems, vol. 4, pp.<br />

42–55, Mar. 1996.<br />

[11] C. Hwang and A. Wu, “A predictive system shutdown method <strong>for</strong> energy saving of event-driven computation,”<br />

in Proc. Int’l Conf. on Computer Aided Design, pp. 28–32, Nov. 1997.<br />

[12] M.Weiser, B.Welch, A. Demers, and S. Shenker, “Scheduling <strong>for</strong> reduced CPU energy,” in Proc. USENIX<br />

Symposium on Operating Systems Design and Implementation, pp. 13–23, 1994.<br />

[13] K. Govil, E. Chan, and H. Wasserman, “Comparing algorithms <strong>for</strong> dynamic speed-setting of a low-power<br />

CPU,” in Proc. ACM Int’l Conf. on Mobile Computing and Networking, pp. 13–25, Nov. 1995.<br />

[14] F. Yao, A. Demers, and S. Shenker, “A scheduling model <strong>for</strong> reduced CPU energy,” in Proc. IEEE <strong>An</strong>nual<br />

Foundations of Computer Science, pp. 374–382, 1995.<br />

[15] I. Hong, D. Kirovski, G. Qu, M. Potkonjak, and M. B. Srivastava, “Power optimization of variable voltage<br />

core-based systems,” in Proc. Design Automat. Conf., pp. 176–181, June 1998.<br />

[16] T. Ishihara and H. Yasuura, “Voltage scheduling problem <strong>for</strong> dynamically variable voltage processors,” in<br />

Proc. Int’l Symposium on Low Power Electronics and Design, pp. 197–202, Aug. 1998.<br />

[17] D. Katcher, H. Arakawa, and J. Strosnider, “Engineering and analysis of fixed priority schedulers,” IEEE<br />

Trans. on Software Eng., vol. 19, pp. 920–934, Sept. 1993.<br />

[18] A. Burns, K. Tindell, and A. Wellings, “Effective analysis <strong>for</strong> engineering realtime fixed priority schedulers,”<br />

IEEE Trans. on Software Eng., vol. 21, pp. 475–480, May 1995.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!