Advertisement

Revisiting Fixed Priority Techniques

  • Nasro Min-Allah
  • Wang Yong-Ji
  • Xing Jian-Sheng
  • Junxiang Liu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4808)

Abstract

Discrete scheduling is preferred over continuous scheduling for preemptive scheduling problems, however, classical continuous schedulability tests can not work effectively with discrete scheduling. This area of integrating discrete scheduling with continuous schedulability tests remains unexplored. Two contributions are made in this paper; firstly, an empty-slot method is introduced and extended to discrete schedulability analysis and secondly, an efficient exact feasibility test is proposed that has lower complexity in contrast to current feasibility tests in terms of reducing the number of scheduling points, where task feasibility is analyzed.

Keywords

Real-Time Systems Fixed priority Scheduling Discrete Scheduling Rate Monotonic Analysis Time Demand Approach 

References

  1. 1.
    Liu, J.W.S.: Real Time Systems. Prentice Hall, Englewood Cliffs (2000)Google Scholar
  2. 2.
    Krishna, C.M., Shin, K.G.: Real-Time Systems. McGrawHill, New York (1997)zbMATHGoogle Scholar
  3. 3.
    Bini, E., Buttazzo, G.C.: The Space of Rate Monotonic Schedulability. In: Proceedings of the 23th IEEE Real-Time Systems Symposium, pp. 169–177 (2002)Google Scholar
  4. 4.
    Bini, E., Buttazzo, G.C.: Schedulability Analysis of Periodic Fixed Priority Systems. IEEE Transactions on Computers 53(11), 1462–1473 (2004)CrossRefGoogle Scholar
  5. 5.
    Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard real-time environment. J. of the ACM 20(1), 40–61 (1973)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Katcher, D.I., Arakawa, H., Strosnider, J.K.: Engineering and analysis of fixed priority schedulers. IEEE Trans. On Software Engineering 19(9), 920–934 (1993)CrossRefGoogle Scholar
  7. 7.
    Baruah, S., Mok, A., Rosier, L.: Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real-Time Systems 2, 301–324 (1990)CrossRefGoogle Scholar
  8. 8.
    Lehoczky, J.P., Sha, L., Ding, Y.: The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior. In: Proceedings of the IEEE Real-Time System Symposium, pp. 166–171 (1989)Google Scholar
  9. 9.
    Audsley, N.C.: Deadline monotonic scheduling, Report YCS.146, Depart. of Comput.Sci., University of York (1990)Google Scholar
  10. 10.
    Santos, J., Gastaminza, M.L., Orozco, J., Picardi, D., Alimenti, O.: Priorities and protocols in hard real-time LANs. Computer and Commun. 14(9), 507–514 (1991)CrossRefGoogle Scholar
  11. 11.
    Santos, J., Orozco, J.: Rate monotonic scheduling in hard real-time systems. Information Processing Letters 48, 39–45 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Audsley, N.C., Burns, A., Richardson, M.F., Wellings, A.J.: Hard real-time scheduling: the deadline monotonic approach. In: Proceedings of 8th IEEE Workshop on Real-Time Operating Systems and Software, pp. 133–137 (1991)Google Scholar
  13. 13.
    Sjodin, M., Hansson, H.: Improved response-time analysis calculations. In: Proceedings of the 19th IEEE Real-Time Systems Symposium, pp. 399–409 (1998)Google Scholar
  14. 14.
    Joseph, M., Pandya, P.: Finding response times in a real-time system. The Computer Journal 29(5), 390–395 (1986)CrossRefMathSciNetGoogle Scholar
  15. 15.
    Leung, J.Y.T., Whitehead, J.: On the Complexity of Fixed-Priority Scheduling of Periodic. Real-Time Tasks Performance Evaluation 2, 237–250 (1982)MathSciNetGoogle Scholar
  16. 16.
    Kuo, T.-W., Mok, A.K.: Load Adjustment in Adaptive Real-Time Systems. In: Proceedings of the IEEE Real-Time Systems Symposium, pp. 160–171 (1991)Google Scholar
  17. 17.
    Manabe, Y., Aoyagi, S.: A feasibility decision algorithm for rate monotonic and deadline monotonic scheduling. Real-Time Systems 14(2), 171–181 (1998)CrossRefGoogle Scholar
  18. 18.
    Tindell, K.W., Bums, A., Wellings, A.J.: An extendible approach for analyzing fixed priority hard real-time tasks. Real-Time Systems Journal 6, 133–151 (1994)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Nasro Min-Allah
    • 1
    • 2
    • 3
  • Wang Yong-Ji
    • 3
  • Xing Jian-Sheng
    • 1
    • 3
  • Junxiang Liu
    • 3
  1. 1.Graduate University, Chinese Academy of Sciences, Beijing 100039P.R. China
  2. 2.Department of Computer Sciences, COMSATS University, 44000Pakistan
  3. 3.Institute of Software, Chinese Academy of Sciences, Beijing 100080P.R. China

Personalised recommendations