Skip to main content

Pre-scheduling for synchronization in hard real-time systems

  • Conference paper
  • First Online:
Operating Systems of the 90s and Beyond

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

Abstract

In future, real-time systems will consist of a number of concurrent processes performing a variety of unrelated or loosely related tasks requiring synchronization among them. The timing properties of synchronizing processes are affected due to waiting time. Hence, it is important that the synchronization primitives are efficient and that they have bounded waiting times so that the processes are not starved and that they meet the deadlines. In this paper, we present a technique in which synchronization constraints are considered during pre-scheduling. This technique involves no runtime synchronization overhead and allows reasoning about the timing properties of processes prior to run-time.

Supported in part by contract DSA-87-C-0066 from the U. S. Army Strategic Defence Command.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gregory R. Andrews and Fred B. Schneider. Concepts and Notations for Concurrent Programming. ACM Computing Surveys, 15(1):3–43, March 1983.

    Article  Google Scholar 

  2. Raymond Keith Clark. Scheduling Dependent Real-Time Activities. Technical Report cmu-cs-90-155, Computer Science Department, Carnegie Mellon University, PA, Aug. 1990.

    Google Scholar 

  3. Stuart R. Falk and David L. Parnas. On Synchronization in Hard-Real-Time Systems. Communications of ACM, 31(3):274–298, March 1988.

    Article  Google Scholar 

  4. S. T. Levi, Satish K. Tripathi, Scott Carson, and Ashok Agrawala. The MARUTI Hard Real-Time Operating System. ACM SIGOPS Operating Systems Review, 23(3), July 1989.

    Google Scholar 

  5. Al Mok. The Design of Real-Time Programming Ssystems Based on Process Models. In Real Time Systems Symposium, pages 5–17. IEEE, 1984.

    Google Scholar 

  6. Lory D. Molesky, Chia Shen, and Goran Zlokapa. Predictable Synchronization Mechanisms for Multiprocessor Real-Time Systems. The Journal of Real-Time Systems, 2:163–180, 1990.

    Article  Google Scholar 

  7. Vivek Nirkhe, Satish Tripathi, and Ashok Agrawala. Language Support for the Maruti Real-Time System. In 11th IEEE Real-Time Systems Symposium, pages 257–266, Dec. 1990.

    Google Scholar 

  8. Lui Sha, Raghunathan Rajkumar, and John P. Lehoczky. Priority Inheritance Protocols: An Approach to Real-Time Synchronization. IEEE Trans. on Computers, 39(9):1175–1185, Sep. 1990.

    Article  Google Scholar 

  9. John A Stankovic. Misconceptions About Real-Time Computing. IEEE Computer Magazine, pages 10–19, Oct. 1988.

    Google Scholar 

  10. Satish K. Tripathi and Vivek Nirkhe. Synchronization in Hard Real-Time Systems. Frontiers in Computing Systems Research — Essays on Emerging Technologies, Architectures and Theories. Plenum Press, 1990. Ed. S. K. Tewksbury.

    Google Scholar 

  11. J. Xu and D. L. Parnas. Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations. IEEE Transactions on Software Engineering, 16(3):360–369, March 1990.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Arthur Karshmer Jürgen Nehmer

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tripathi, S.K., Nirkhe, V. (1991). Pre-scheduling for synchronization in hard real-time systems. In: Karshmer, A., Nehmer, J. (eds) Operating Systems of the 90s and Beyond. Lecture Notes in Computer Science, vol 563. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024531

Download citation

  • DOI: https://doi.org/10.1007/BFb0024531

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54987-1

  • Online ISBN: 978-3-540-46630-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics