skip to main content
article

The implementation of the Priority Ceiling Protocol in Ada-2005

Published:01 April 2007Publication History
Skip Abstract Section

Abstract

Ada 2005 is an even safer and more agile language than its predecessors, with all of the efficiency that is a hallmark of the Ada language design. It still has a strong focus on real-time response, multi-tasking, and sound engineering. It is the only international standard for object-oriented real-time distributed programming. High-integrity systems rarely make use of high-level language features such as Ada Protected Objects. Protected Types provide a passive mechanism for communication and synchronization between tasks. In this paper, we present some of these features, which are implemented using the Priority Ceiling Protocol (PCP). PCP is an extension of the Priority Inheritance Protocol (PIP), with the added features of preventing deadlocks and priority inversions. Priority inversion occurs when a high priority task is blocked for an unbounded time by lower priority tasks. Unfortunately though, PCP is not known to be supported by any operating systems. This article describes an implementation of PCP in Ada-2005. A detailed discussion of this protocol, and other related issues, are presented.

References

  1. A. Burns and A. J. Wellings, Real-Time Systems and Programming Languages, 3rd. ed: Addison-Wesley, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Aburas, Jim. "Optimal Mutex Policy in Ada 95", Dec. 1995, ACM Press, vol. XV, issue 6, pp. 46--56. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. ACM Ada Letters, Proceedings of the 8* International Real-Time Ada Workshop: Tasking Profiles (September 1997).Google ScholarGoogle Scholar
  4. Burns, A. and Wellings, A. J. Concurrency in Ada, Cambridge University Press (1995) Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Buttazzo, G. C. 1997. Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications. Kluwer. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Liu, C. & Layland, J., Scheduling algorithms for multiprogramming in hard real-tie environments. Journal of the ACM, Vol.20, N0.1, 1973. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Miranda, J., GNAT and Ada 2005, Reference Manual, January 2005.Google ScholarGoogle Scholar
  8. Mok, A. "Fundamental design problems of distributed systems for the hard real-time environment," PhD thesis, 1983.Google ScholarGoogle Scholar
  9. Sha, L., Rajkumar, R. & Lehoczky, J., Priority Inheritance Protocols: An Approach to Real-Time Synchronization. IEEE Transactions on Computer, September 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Sha, L. & Goodenough, J., Real-time scheduling theory and Ada. IEEE Transactions on Computer, Vol. 23, No. 4, April 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Sha, L., Rajkumar, R. & Lehoczky, J., Generalized rate-monotonic scheduling theory: a framework for developing real-time systems. Proceedings of the IEEE, Volume 82, Issue 1, Jan. 1994.Google ScholarGoogle Scholar
  12. Wellings, A. J., R. W. Johnson, B. I. Sanden, J. Kienzle, T. Wolf, and S. Michell. "Integrating Object-Oriented Programming and Protected Objects in Ada 95." ACM 2000: 506--539. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Wellings, A. J. Concurrent and Real-Time Programming in Java. John Wiley & Sons, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. The implementation of the Priority Ceiling Protocol in Ada-2005

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM SIGAda Ada Letters
        ACM SIGAda Ada Letters  Volume XXVII, Issue 1
        April 2007
        16 pages
        ISSN:1094-3641
        DOI:10.1145/1274610
        Issue’s Table of Contents

        Copyright © 2007 Authors

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 1 April 2007

        Check for updates

        Qualifiers

        • article

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!