Real-Time Scheduling for Embedded Systems

  • Marco Caccamo
  • Theodore Baker
  • Alan Burns
  • Giorgio Buttazzo
  • Lui Sha
Part of the Control Engineering book series (CONTRENGIN)

A real-time system is one with explicit deterministic or probabilistic timing requirements. Historically, real-time systems were scheduled by cyclic executives, constructed in a rather ad hoc manner. During the 1970s and 1980s, there was a growing realization that this static approach to scheduling produced systems that were inflexible and difficult to maintain. Building upon the seminal work of Liu and Layland [27], a successful effort was made to develop a practical theory of dynamic real-time scheduling, which led to the main body of fixed priority scheduling results reported here. In addition, there were notable and timely successes in the application of this theory to national high technology projects including a global positioning satellite software upgrade [17] and the International Space Station.


Earliest Deadline First Periodic Task Sporadic Task High Priority Task Relative Deadline 
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.
    T. Abdelzaher, V. Sharma, and C. Lu. A utilization bound for aperiodic tasks and priority driven scheduling. IEEE Trans. on Computers, 53(3):334-350, Mar. 2004. CrossRefGoogle Scholar
  2. 2.
    L. Abeni and G. Buttazzo. Integrating multimedia applications in hard real-time systems. In Proc. 19th IEEE Real-Time Systems Symposium, Madrid, Spain, Dec. 1998.Google Scholar
  3. 3.
    N. C. Audsley, A. Burns, R. Davis, K. Tindell, and A. J. Wellings. Fixed priority preemptive scheduling: A historical perspective. Real Time Systems, 8(3):173-198,1995.CrossRefGoogle Scholar
  4. 4.
    T. P. Baker. Stack-based scheduling of real-time processes. Real-Time Systems, 3(1):67-100, Mar. 1991.CrossRefGoogle Scholar
  5. 5.
    T. P. Baker and O. Pazy. Real-time features for Ada 9X. In Proc. 12th IEEE Real-Time Systems Symposium, pages 172-180, 1991.Google Scholar
  6. 6.
    S. K. Baruah, R. R. Howell, and L. E. Rosier. Algorithms and complexity con-cerning the preemptive scheduling of periodic real-time tasks on one processor. Real-Time Systems, 2:173-179, 1990.CrossRefMathSciNetGoogle Scholar
  7. 7.
    S. K. Baruah, A. K. Mok, and L. E. Rosier. Preemptively scheduling hard-real-time sporadic tasks on one processor. Proc. 11th IEE Real-Time Systems Symposium, pages 182-190, 1990.Google Scholar
  8. 8.
    G. Bernat and A. Burns. Combining (n, m)-hard deadlines with dual priority scheduling. In Proc. 18th IEEE Real-Time Systems Symposium, pages 46-57, 1997.Google Scholar
  9. 9.
    G. Bernat and A. Burns. New results on fixed priority aperiodic servers. In Proc. 20th IEEE Real-Time Systems Symposium, pages 68-78, 1999.Google Scholar
  10. 10.
    A. Burns and A. J. Wellings. Dual priority assignment: A practical method of increasing processor utilization. In Proc. Fifth Euromicro Workshop on Real-Time Systems, pages 48-53, Oulu, Finland, 1993. IEEE Computer Society.CrossRefGoogle Scholar
  11. 11.
    G. Buttazzo, G. Lipari, M. Caccamo, and L. Abeni. Elastic scheduling for flexible workload management. IEEE Trans. on Computers, 51(3):289-302, Mar. 2002.CrossRefGoogle Scholar
  12. 12.
    G. Buttazzo and F. Sensini. Optimal deadline assignment for scheduling soft aperiodic tasks in hard real-time environments. IEEE Trans. on Computers, 48(10):1035-1052, Oct. 1999.CrossRefGoogle Scholar
  13. 13.
    M. Caccamo and G. Buttazzo. Exploiting skips in periodic tasks for enhancing aperiodic responsiveness. In Proc. IEEE 18th Real-Time Systems Symposium, pages 330-339, San Francisco, 1997.Google Scholar
  14. 14.
    M. Caccamo, G. Buttazzo, and L. Sha. Capacity sharing for overrun control. In Proc. 21st IEEE Real-Time Systems Symposium, pages 295-304, Orlando, FL, USA, Dec. 2000.Google Scholar
  15. 15.
    M. Caccamo and L. Sha. Aperiodic servers with resource constraints. In Proc. 22nd IEEE Real-Time Systems Symposium, pages 161-170, London, UK, Dec. 2001.Google Scholar
  16. 16.
    M. L. Dertouzos. Control robotics: The procedural control of physical processes. Information Processing, 74, 1974.Google Scholar
  17. 17.
    L. Doyle and J. Elzey. Successful use of rate monotonic theory on a formidable real time system. In Proc. 11th IEEE Workshop on Real-Time Operating Sys-tems and Software, pages 74-78, May 1994.Google Scholar
  18. 18.
    T. M. Ghazalie and T. P. Baker. Aperiodic servers in a deadline scheduling environment. Real-Time Systems, 9:31-67, 1995.CrossRefGoogle Scholar
  19. 19.
    M. G. Harbour, M. H. Klein, and J. P. Lehoczky. Fixed priority scheduling of periodic tasks with varying execution priority. In Proc. 12th IEEE Real-Time Systems Symposium, 1991.Google Scholar
  20. 20.
    K. Jeffay. Scheduling sporadic tasks with shared resources in hard-real-time systems. In Proc. 13th IEEE Real-Time Systems Symposium, pages 89-99, Phoenix, AZ, USA, Dec. 1992.Google Scholar
  21. 21.
    M. Joseph and P. Pandya. Finding response times in a real-time system. BCS Computer Journal, 29(5):390-395, 1986.CrossRefMathSciNetGoogle Scholar
  22. 22.
    G. Koren and D. Shasha. Skip-over: Algorithms and complexity for overloaded systems that allow skips. In Proc. IEEE Real Time System Symposium, pages 110-117, Pisa, 1995.Google Scholar
  23. 23.
    J. P. Lehoczky, L. Sha, and D. Y. Ding. The rate monotonic scheduling algo-rithm: exact characterization and average case behavior. In Proc. 10th IEEE Real-Time Systems Symposium, pages 166-171, 1989.Google Scholar
  24. 24.
    J. Y. T. Leung and J. Whitehead. On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation (Netherlands), 2(4):237-250,1982.zbMATHCrossRefMathSciNetGoogle Scholar
  25. 25.
    G. Lipari and S. K. Baruah. Greedy reclamation of unused bandwidth in con-stant bandwidth servers. In Proc. 12th Euromicro Conference on Real-Time Systems, pages 192-200, Stockholm, Sweden, June 2000.Google Scholar
  26. 26.
    G. Lipari and G. Buttazzo. Schedulability analysis of periodic and aperiodic tasks with resource constraints. Journal of Systems Architecture, 46(4):327-338, Jan. 2000.CrossRefGoogle Scholar
  27. 27.
    C. L. Liu and J. W. Layland. Scheduling alghorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 20(1):46-61, Jan. 1973.zbMATHCrossRefMathSciNetGoogle Scholar
  28. 28.
    J. W. S. Liu. Real-Time Systems. Prentice-Hall, Upper Saddle River, NJ, 2000.Google Scholar
  29. 29.
    A. K. Mok. Fundamental Design Problems of Distributed Systems for the Hard Real-Time Environment. Ph.D. thesis, Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, Cambridge, MA, 1983.Google Scholar
  30. 30.
    R. Rajkumar, L. Sha, and J. P. Lehoczky. Real-time synchronization protocols for multiprocessors. In Proc. 9th IEEE Real-Time Systems Symposium, pages 259-269, 1988.Google Scholar
  31. 31.
    L. Sha, T. Abdelzaher, K.-E. Årzén, A. Cervin, T. Baker, A. Burns, G. Buttazzo,. M. Caccamo, J. Lehoczky, and A. Mok. Real time scheduling theory: A historical perspective. Real-Time Systems, 28(2-3):101-155, Nov. 2004.zbMATHCrossRefGoogle Scholar
  32. 32.
    L. Sha and J. Goodenough. Real-time scheduling theory and Ada. IEEE Com-puter, 23(4):53-62, 1990.Google Scholar
  33. 33.
    L. Sha, J. P. Lehoczky, and R. Rajkumar. Solutions for some practical problems in prioritizing preemptive scheduling. In Proc. 7th IEEE Real-Time Sytems Symposium, pages 181-191, 1986.Google Scholar
  34. 34.
    L. Sha, R. Rajkumar, and J. P. Lehoczky. Priority inheritance protocols: An approach to real-time synchronisation. IEEE Trans. on Computers, 39(9):1175-1185,1990.CrossRefMathSciNetGoogle Scholar
  35. 35.
    W. Shih, W. S. Liu, and J. Chung. Algorithms for scheduling imprecise com-putations with timing constraints. SIAM Journal of Computing, 20(3):537-552, July 1991.zbMATHCrossRefMathSciNetGoogle Scholar
  36. 36.
    B. Sprunt, J. Lehoczky, and L. Sha. Exploiting unused periodic time for aperi-odic service using the extended priority exchange algorithm. In Proc. 9th IEEE Real-Time Systems Symposium, pages 251-258, 1988.Google Scholar
  37. 37.
    B. Sprunt, L. Sha, and L. Lehoczky. Aperiodic task scheduling for hard real-time systems. Real-Time Systems, 1(1):27-60, 1989.CrossRefGoogle Scholar
  38. 38.
    M. Spuri and G. Buttazzo. Scheduling aperiodic tasks in dynamic priority systems. Real-Time Systems, 10(2):179-210, Mar. 1996.CrossRefGoogle Scholar
  39. 39.
    J. A. Stankovic, C. Lu, S. Son, and G. Tao. The case for feedback control real-time scheduling. In IEEE Proc. 11th Euromicro Conference on Real-Time Systems, pages 11-20, York, U.K., June 1999.Google Scholar
  40. 40.
    J. A. Stankovic, K. Ramamritham, M. Spuri, and G. Buttazzo. Deadline schedul-ing for real-time systems. Kluwer, Boston-Dordrecht-London, 1998.Google Scholar
  41. 41.
    J. Strosnider, J. P. Lehoczky, and L. Sha. The deferrable server algorithm for enhanced aperiodic responsiveness in real-time environments. IEEE Trans. on Computers, 44(1):73-91, Jan. 1995.zbMATHCrossRefGoogle Scholar

Copyright information

© Birkhäuser Boston 2005

Authors and Affiliations

  • Marco Caccamo
    • 1
  • Theodore Baker
    • 2
  • Alan Burns
    • 3
  • Giorgio Buttazzo
    • 4
  • Lui Sha
    • 1
  1. 1.University of Illinois at Urbana ChampaignUSA
  2. 2.Florida State UniversityUSA
  3. 3.University of YorkUK
  4. 4.University of PaviaItaly

Personalised recommendations