Rate Monotonic Analysis for Real-Time Systems

  • Lui Sha
  • Mark H. Klein
  • John B. Goodenough
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 141)


As a mathematical discipline travels far from its empirical source, or still more, if it is a second and third generation only indirectly inspired by the ideas coming from ‘reality,’ it is besetwith very grave dangers. It becomes more and more pure aestheticizing, more and more purely more and more purely l’art pour l’art....


Priority Level Direct Memory Access Schedulability Test High Priority Task Aperiodic Task 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Borger, M. W., Klein, M. H., and Veltre, R. A. “Real-Time Software Engineering in Ada: Observations and Guidelines”. Software Engineering Institute Technical Review (1988).Google Scholar
  2. 2.
    Borger, M.W., and Rajkumar, R. Implementing Priority Inheritance Algorithms in an Ada Runtime System. Tech. Rept. CMU/SEI-89-TR-15, ADA20967, Software Engineering Institute, April 1989.Google Scholar
  3. 3.
    Cornhill, D. “Tasking Session Summary”. Proceedings of ACM International Workshop on Real-Time Ada Issues, Ada Newsletter VII Vol. 6 (1987), pp. 29–32Google Scholar
  4. 4.
    Futurebus P896.1 Specification, Draft 1.0. IEEE, 345 East 47th St., New York, NY 10017, 1990. Prepared by the P896.2 Working Group of the Microprocessor Standards Committee.Google Scholar
  5. 5.
    Goodenough, J. B., and Sha, L. “The Priority Ceiling Protocol: A Method for Minimizing the Blocking of High Priority Ada Tasks”. Proceedings of the 2nd International Workshop on Real-Time Ada Issues (June 1988).Google Scholar
  6. 6.
    Kirk, D., and Strosnider, J. K. “SMART (Strategic Memory Allocation for Real-Time) Cache Design Using MIPS R3000”. Proceedings of the IEEE Real-Time Systems Symposium (1990).Google Scholar
  7. 7.
    Klein, M. H., and Ralya, T. An Analysis of Input/Output Paradigms for Real-Time Systems. Tech. Rept. CMU/SEI-90-TR-19, ADA226724, Software Engineering Institute, July 1990.Google Scholar
  8. 8.
    Lehoczky, J.P.,Sha, L., and Strosnider, J.K. “Enhanced Aperiodic Scheduling In Hard Real-Time Environments”. Proceedings of the IEEE Real-Time Systems Symposium (December 1987), 261–270.Google Scholar
  9. 9.
    Lehoczky, J.P.,Sha, L., and Ding, Y. “The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior”. Proceedings of IEEE Real-Time System Symposium (1989)Google Scholar
  10. 10.
    Lehoczky, J. P.,and Sha, L. “Performance of Real-Time Bus Scheduling Algorithms”. ACM Performance Evaluation Review, Special Issue 14,1 (May 1986)Google Scholar
  11. 11.
    Liu, C.L., and Layland, J.W. “Scheduling Algorithms for Multi-Programming in a Hard Real-Time”. Journal of the Association for Computing Machinery Vol. 20,1 (January 1973 ), pp. 46–61.MathSciNetMATHCrossRefGoogle Scholar
  12. 12.
    Locke, D., Sha, L., Rajkumar, R., Lehoczky, J. P., and Bums, G. “Priority Inversion and Its Control: An Experimental Investigation”. Proceedings of the 2nd ACM International Workshop on Real-Time Ada Issues (1988).Google Scholar
  13. 13.
    Locke, C. D., Vogel, D. R., Lucas, L., and Goodenough, J. B. Generic Avionics Software Specification. Tech. Rept. CMU/SEI-90-TR-08, Software Engineering Institute, Carnegie Mellon University, November 1990.Google Scholar
  14. 14.
    Mok, A. K. Fundamental Design Problems of Distributed Systems for The Hard Real Time Environment Ph.D. Th., Massachusetts Institute of Technology, 1983. Ph. D. ThesisGoogle Scholar
  15. 15.
    Rajkumar, R., Sha, L., and Lehoczky, J.P. “Real-Time Synchronization Protocols for Multiprocessors”. Proceedings of the IEEE Real-Time Systems Symposium (December 1988)Google Scholar
  16. 16.
    Rajkumar, R. “Real-Time Synchronization Protocols for Shared Memory Multi-Processors”. Proceedings of The 10th International Conference on Distributed Computing (1990).Google Scholar
  17. 17.
    Sha, L., Lehoczky, J.P., and Rajkumar, R. “Solutions for Some Practical Problems in Prioritized Preemptive Scheduling”. Proceedings of the IEEE Real-Time Systems Symposium (December 1986), 181–191.Google Scholar
  18. 18.
    Sha, L., Rajkumar, R., Lehoczky, J., and Ramamritham K. “Mode Change Protocols for Priority-Driven Preemptive Scheduling”. The Journal of Real-Time Systems Vol. 1 (1989), pp. 243–264.CrossRefGoogle Scholar
  19. 19.
    Sha, L., Rajkumar, R. and Lehoczky, J. P. “Priority Inheritance Protocols: An Approach to Real-Time Synchronization”. IEEE Transactions on Computers (September 1990).Google Scholar
  20. 20.
    Sha, L. and Goodenough, J. B. “Real-Time Scheduling Theory and Ada”. IEEE Computer (April, 1990).Google Scholar
  21. 21.
    Sha, L., Rajkumar, R., and Locke, D. Real-Time Applications Using Multiprocessors: Scheduling Algorithms and System Support. Tech. Rept. in preparation, Software Engineering Institution, Carnegie Mellon, Pgh., PA, 1990.Google Scholar
  22. 22.
    Sha, L., Rajkumar, R., and Lehoczky, J. “Real-Time Computing Using Futurebus+”. IEEE Micro (To appear in 1991).Google Scholar
  23. 23.
    Sprunt, B., Lehoczky, J. P., and Sha, L. “Exploiting Unused Periodic Time For Aperiodic Service Using The Extended Priority Exchange Algorithm” Proceedings of the IEEE Real-Time Systems Symposium (December 1988).Google Scholar
  24. 24.
    Sprunt, B., Sha, L., and Lehoczky, J.P. “Aperiodic Task Scheduling for Hard Real-Time Systems”. The Journal of Real-Time Systems, 1 (1989), pp. 27–60.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 1991

Authors and Affiliations

  • Lui Sha
    • 1
  • Mark H. Klein
    • 1
  • John B. Goodenough
    • 1
  1. 1.Software Engineering InstituteCarnegie Mellon UniversityUSA

Personalised recommendations