Skip to main content
SpringerLink
Log in

Scheduling of Real-Time Tasks with Complex Constraints

  • Chapter
  • First Online:
Performance Evaluation: Origins and Directions

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1769))

Abstract

Real-time computer systems are characterized by the existence of timing constraints as well as logical correctness requirements on computations they carry out. The timing constraints are statically determined prior to system operation time from the characteristics of physical systems they interact with. In hard real-time systems, a timing failure is considered catastrophic and a guarantee should be given prior to runtime that every timing constraint will be satisfied throughout the system operation time. Examples are found in application domains such as avionics, process control, automated manufacturing, robotics, etc. In this paper, the issues and approaches on real-time system design will be addressed in uni-processor environment.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. C. Audsley. Deadline monotonic scheduling. YCS 146, University of York, Department of Computer Science, October 1990.

    Google Scholar 

  2. A. Burns. Fixed Priority Scheduling with Deadlines Prior to Completion. Technical Report YCS 212 (1993), Department of Computer Science, University of York, England, 1993.

    Google Scholar 

  3. T. Carpenter, K. Driscoll, K. Hoyme, and J. Carciofini. Arinc 659 scheduling: Problem definition. In Proc., IEEE Real-time Systems Symposium, San Juan, PR, December 1994.

    Google Scholar 

  4. S. Cheng and A. K. Agrawala. Scheduling of periodic tasks with relative timing constraints. Technical report, CS-TR-3392, UMIACS-TR-94-135, Department of Computer Science, University of Maryland, December 1994.

    Google Scholar 

  5. S. Cheng and Ashok K. Agrawala. Allocation and scheduling of real-time periodic tasks with relative timing constraints. Technical Report CS-TR-3402, UMIACSTR-95-6, Department of Computer Science, University of Maryland, January 1995.

    Google Scholar 

  6. H. Chetto and M. Chetto. Scheduling Periodic and Sporadic Task in a Real-Time System. Information Processing Letters, 30(4):177–184, 1989.

    Article  MathSciNet  Google Scholar 

  7. H. Chetto and M. Chetto. Some Results of the Earliest Deadline First Algorithm. IEEE Transactions on Software Engineering, SE-15(10):1261–1269, October 1989.

    Article  MathSciNet  Google Scholar 

  8. H. Chetto, M. Silly, and T. Bouchentouf. Dynamic Scheduling of Real-Time Tasks under Precedence Constraints. Real-Time Systems, 2:181–194, 1990.

    Article  Google Scholar 

  9. S. Choi. End-to-end optimization in heterogeneous distributed real-time systems. In ACM/SIGPLAN Workshop on Languages, Compilers, and Tools for Embedded Systems, June 1998.

    Google Scholar 

  10. Seonho Choi. Dynamic Time-Based Scheduling for Hard Real-Time Systems. PhD thesis, University of Maryland at College Park, 1997.

    Google Scholar 

  11. Seonho Choi and A. K. Agrawala. Dynamic dispatching of cyclic real-time tasks with relative constraints. Technical report, CS-TR-3770, UMIACS-TR-97-30, Department of Computer Science, University of Maryland, March 1997. Submitted to Journal of Real-Time System.

    Google Scholar 

  12. Seonho Choi and Ashok K. Agrawala. Dynamic dispatching of cyclic real-time tasks with relative constraints. Technical Report CS-TR-3770, UMIACS-TR-97-30, Department of Computer Science, University of Maryland, March 1997.

    Google Scholar 

  13. G. Dantzig and B. Eaves. Fourier-Motzkin Elimination and its Dual. Journal of Combinatorial Theory(A), 14:288–297, 1973.

    Article  MATH  MathSciNet  Google Scholar 

  14. B. Dasarathy. Timing constraints for real-time systems: Constructs for expressing them, methods of validating them. IEEE Transactions on Software Engineering, SE-11(1):80–86, January 1985.

    Article  Google Scholar 

  15. R. Gerber, S. Hong, and M. Saksena. Guaranteeing End-to-End Timing Constraints by Calibrating Intermediate Processes. In Proceedings IEEE Real-Time Systems Symposium, 1994. Also available as University of Maryland CS-TR-3274, UMIACS-TR-94-58.

    Google Scholar 

  16. R. Gerber, W. Pugh, and M. Saksena. Parametric Dispatching of Hard Real-Time Tasks. IEEE Transactions on Computers, 44(3), Mar. 1995.

    Google Scholar 

  17. M. G. Harbour, M. H. Klein, and J. P. Lehoczky. Fixed Priority Scheduling of Periodic Tasks with Varying Execution Priority. In Proceedings, IEEE Real-Time Systems Symposium, pages 116–128, December 1991.

    Google Scholar 

  18. X. Homayoun and P. Ramanathan. Dynamic priority scheduling of periodic and aperiodic tasks in hard real-time systems. Real-Time Systems, 6(2), March 1994.

    Google Scholar 

  19. Seung H. Hong. Scheduling Algorithm of Data Sampling Times in the Integrated Communication and Control Systems. IEEE Transactions on Control Systems Technology, 3(2):225–230, June 1995.

    Article  Google Scholar 

  20. F. Jahanian and A. K. Mok. Safety analysis of timing properties in real-time systems. IEEE Transactions on Software Engineering, SE-12(9):890–904, September 1986.

    Google Scholar 

  21. E. D. Jensen, C. D. Locke, and H. Tokuda. A Time-Driven Scheduling Model for Real-Time Operating Systems. In Proceedings, IEEE Real-Time Systems Symposium, pages 112–122, Dec. 1985.

    Google Scholar 

  22. M. Joseph and P. Pandya. Finding Response Times in a Real-Time System. The Computer Journal, 29(5):390–395, October 1986.

    Article  MathSciNet  Google Scholar 

  23. M. Klein, T. Ralya, B. Pollak, R. Obenza, and M. Harbour. A Practitioner’s Handbook for Real-Time Analysis. Kluwer Academic Publishers, 1993.

    Google Scholar 

  24. J. P. Lehoczky, L. Sha, and Y. Ding. The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior. In Proceedings, IEEE Real-Time Systems Symposium, pages 166–171, Dec. 1989.

    Google Scholar 

  25. J. P. Lehoczky, J. Strosnider, L. Sha, and H. Tokuda. Fixed priority scheduling theory for hard real-time systems. In Proc. of the Third Annual Workshop on Foundations of Real-Time Computing, pages 49–71, Oct. 1990.

    Google Scholar 

  26. J.Y. Leung and J. Whitehead. On the Complexity of Fixed-Priority Scheduling of Periodic, Real-Time Tasks. Performance Evaluation, 2(4):237–250, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  27. C. L. Liu and J. Layland. Scheduling Algorithm for Multiprogramming in a Hard Real-Time Environment. Journal of the ACM., 20(1):46–61, Jan. 1973.

    Article  MATH  MathSciNet  Google Scholar 

  28. C. D. Locke. Software architecture for hard real-time applications: Cyclic executives vs. fixed priority executives. Real-Time Systems, 4(1):37–53, March 1992.

    Article  Google Scholar 

  29. A. K. Mok. Fundamental Design Problems for the Hard Real-time Environments. PhD thesis, MIT, May 1983.

    Google Scholar 

  30. M. Saksena. Parametric Scheduling for Hard Real-Time Systems. PhD thesis, University of Maryland, College Park, MD 20742, 1994.

    Google Scholar 

  31. M. Saksena and A. K. Agrawala. Temporal Analysis for Hard-Real Time Scheduling. In Proceedings 12th International Phoenix Conference on Computers and Communications, pages 538–544, March 1993.

    Google Scholar 

  32. Manas Saksena. Parametric Scheduling for Hard Real-Time Systems. PhD thesis, University of Maryland at College Park, 1994.

    Google Scholar 

  33. Manas Saksena, James da Silva, and Ashok K. Agrawala. “esign and implementation of Maruti-II”, chapter 4. Prentice Hall, 1995. In Advances in Real-Time Systems, edited by Sang H. Son.

    Google Scholar 

  34. K. Schwan and H. Zhou. Dynamic Scheduling of Hard Real-Time Tasks and Real-Time Threads. IEEE Transactions on Software Engineering, 18(8):736–748, August 1992.

    Article  Google Scholar 

  35. L. Sha, R. Rajkumar, and J. P. Lehoczky. Priority Inheritance Protocols: An Approach to Real-Time Synchronization. IEEE Transactions on Computers, 39(9):1175–1185, September 1990.

    Article  MathSciNet  Google Scholar 

  36. K. Tindell, A. Burns, and A. Willings. An extendible approach for analyzing fixed priority hard real-time tasks. Real-Time Systems, 6(2), March 1994.

    Google Scholar 

  37. J. Xu and D. L. Parnas. On Satisfying Timing Constraints in Hard-Real-Time Systems. In Proceedings of the ACM SIGSOFT’91 Conference on Software for Critical Systems, pages 132–146, December 1991.

    Google Scholar 

  38. X. Yuan, M. Saksena, and A. Agrawala. A Decomposition Approach to Real-Time Scheduling. Real-Time Systems, 6(1), 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Bowie State University, Bowie, MD, 20715, USA

    Seonho Choi

  2. Institute for Advanced Computer Studies, Department of Computer Science, University of Maryland, College Park, MD, 20742, USA

    Ashok K. Agrawala

Authors
  1. Seonho Choi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ashok K. Agrawala
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Angewandte Informatik und Informationssysteme, Universität Wien, Lenaugasse 2/8, 1080, Wien, Austria

    Günter Haring

  2. Informatik IV, Universität Dortmund, August-Schmidt-Straße 12, 44227, Dortmund, Germany

    Christoph Lindemann

  3. GMD Institut für Medienkommunikation, Schloß Birlinghoven, Postfach 1316, 53754, Sankt Augustin, Germany

    Martin Reiser

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Choi, S., Agrawala, A.K. (2000). Scheduling of Real-Time Tasks with Complex Constraints. In: Haring, G., Lindemann, C., Reiser, M. (eds) Performance Evaluation: Origins and Directions. Lecture Notes in Computer Science, vol 1769. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46506-5_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-46506-5_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67193-0

  • Online ISBN: 978-3-540-46506-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation