Youngsoo Shin
- 1.C.L. Liu and J. W. Layland, "Scheduling algorithms for multiprogramming in a hard real time environment," J. ACM, vol. 20, pp. 46-61, Jan. 1973.]] Google Scholar
Digital Library
- 2.J. Lehoczky, L. Sha, and Y. Ding, "The rate monotonic scheduling algorithm: exact characterization and average case behavior," in Proc. IEEE Real-Time Systems Symposium, pp. 166-171, Dec. 1989.]]Google ScholarCross Ref
- 3.M. Joseph and R Pandya, "Finding response times in a real-time system," The Computer J., vol. 29, pp. 390-395, Oct. 1986.]]Google ScholarCross Ref
- 4.N. Audsley, A. Burns, M. Richardson, and A. Wellings, "Hard real-time scheduling: The deadline-monotonic approach," in Proc. IEEE Workshop on Real-Time Operating Systems and Software, pp. 133-137, May 1991.]]Google ScholarCross Ref
- 5.C. Park and A. C. Shaw, "Experiments with a program timing tool based on source-level timing schema," IEEE Computer, pp. 48-57, May 1991.]] Google ScholarDigital Library
- 6.S. Lira, Y. Bae, G. Jang, B. Rhee, S. Min, C. Park, H. Shin, K. Park, and C. Kim, "An accurate worst case timing analysis for RISC processors," in P~vc. IEEE Real-Time Systems Symposium, pp. 97-108, Dec. 1994.]]Google Scholar
- 7.Y. S. Li, S. Malik, and A. Wolfe, "Performance estimation of embedded software with instruction cache modeling," in P~vc. lnt'l Conf. on Computer Aided Design, pp. 380-387, Nov. 1995.]] Google ScholarDigital Library
- 8.R. Ernst and W. Ye, "Embedded program timing analysis based on path clustering and architecture classification," in P~vc. lnt'l Conf. on Computer Aided Design, pp. 598-604, Nov. 1997.]] Google ScholarDigital Library
- 9.S. Gary, "PowerPC: A microprocessor for portable computers," 1EEE Design & Test of Computers, pp. 14-23, Dec. 1994.]] Google ScholarDigital Library
- 10.M.B. Srivastava, A. P. Chandrakasan, and R. W. Brodersen, "Predictive system shutdown and other architectural techniques for energy efficient programmable computation," 1EEE Trans. on VLS1 Systems, vol. 4, pp. 42-55, Mar. 1996.]] Google ScholarDigital Library
- 11.C. Hwang and A. Wu, "A predictive system shutdown method for energy saving of event-driven computation," in P~vc. lnt'l Conf. on Computer Aided Design, pp. 28-32, Nov. 1997.]] Google ScholarDigital Library
- 12.M. Weiser, B. Welch, A. Demers, and S. Shenker, "Scheduling for reduced CPU energy," in P~vc. USENIX Symposium on Operating Systems Design and Implementation, pp. 13-23, 1994.]] Google ScholarDigital Library
- 13.K. Govil, E. Chan, and H. Wasserman, "Comparing algorithms for dynamic speed-setting of a low-power CPU," in P~vc. ACM Int'l Conf. on Mobile Computing and Networking, pp. 13-25, Nov. 1995.]] Google ScholarDigital Library
- 14.F. Yao, A. Demers, and S. Shenker, "A scheduling model for reduced CPU energy," in P1vc. IEEE Annual Foundations of Computer Science, pp. 374-382, 1995.]] Google ScholarDigital Library
- 15.I. Hong, D. Kirovski, G. Qu, M. Potkonjak, and M. B. Srivastava, "Power optimization of variable voltage core-based systems," in P~vc. Design Automat. Conf., pp. 176-181, June 1998.]] Google ScholarDigital Library
- 16.T. Ishihara and H. Yasuura, "Voltage scheduling problem for dynamically variable voltage processors," in P~vc. Int'l Symposium on Low Power Electlvnics and Design, pp. 197-202, Aug. 1998.]] Google ScholarDigital Library
- 17.D. Katcher, H. Arakawa, and J. Strosnider, "Engineering and analysis of fixed priority schedulers," IEEE Trans. on Software Eng., vol. 19, pp. 920-934, Sept. 1993.]] Google ScholarDigital Library
- 18.A. Burns, K. Tindell, and A. Wellings, "Effective analysis for engineering realtime fixed priority schedulers," IEEE Trans. on Software Eng., vol. 21, pp. 475- 480, May 1995.]] Google ScholarDigital Library
- 19.T. Burd and R. Brodersen, "Processor design for portable systems," Journal of VLSI Signal P~vcessing, vol. 13, pp. 203-222, Aug. 1996.]]Google ScholarDigital Library
- 20.T. Pering, T. Burd, and R. Brodersen, "The simulation and evaluation of dynamic voltage scaling algorithms," in P~vc. Int' l Symposium on Low Power Elect~vnics and Design, pp. 76-81, Aug. 1998.]] Google ScholarDigital Library
- 21.C. Locke, D. Vogel, and T. Mesler, "Building a predictable avionics platform in Ada: a case study," in P~vc. IEEE Real-Time Systems Symposium, Dec. 1991.]]Google ScholarCross Ref
- 22.J. Liu, J. Redondo, Z. Deng, T. Tia, R. Bettati, A. Silberman, M. Storch, R. Ha, and W. Shih, "PERTS: A prototyping environment for real-time systems," Tech. Rep. UIUCDCS-R-93-1802, University of Illinois, 1993.]] Google ScholarDigital Library
- 23.N. Kim, M. Ryu, S. Hong, M. Saksena, C. Choi, and H. Shin, "Visual assessment of a real-time system design: a case study on a CNC controller," in P~vc. IEEE Real-Time Systems Symposium, Dec. 1996.]] Google ScholarDigital Library
Index Terms
- Power conscious fixed priority scheduling for hard real-time systems
Recommendations
Timing Analysis for Fixed-Priority Scheduling of Hard Real-Time Systems
This paper presents a timing analysis for a quite general hard real-time periodic task set on a uniprocessor using fixed-priority methods. Periodic tasks are composed of serially executed subtasks, where each subtask is characterized by an execution ...
Weakly Hard Schedulability Analysis for Fixed Priority Scheduling of Periodic Real-Time Tasks
Special Issue ESWEEK 2017, CASES 2017, CODES + ISSS 2017 and EMSOFT 2017The hard deadline model is very popular in real-time research, but is representative or applicable to a small number of systems. Many applications, including control systems, are capable of tolerating occasional deadline misses, but are seriously ...
Analyzing Stochastic Fixed-Priority Real-Time Systems
TACAS '99: Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of SystemsTraditionally, real-time systems require that the deadlines of all jobs be met. For many applications, however, this is an overly stringent requirement. An occasional missed deadline may cause decreased performance but is nevertheless acceptable. We ...
Comments