skip to main content
research-article

Incorporating the deadline floor protocol in ada

Published:08 November 2013Publication History
Skip Abstract Section

Abstract

The Ada 2005 standard introduced "Earliest Deadline First" (EDF) as one of the supported dispatching policies. The standard specifies the "Stack Resource Protocol" (SRP) as the protocol for resource sharing among EDF tasks. During the time the SRP has been in the standard it has shown to be a relatively complex protocol. Recently, a new protocol has been proposed for resource sharing in EDF. This new protocol, called "Deadline Floor inheritance Protocol" (DFP), is simpler and more efficient than SRP while keeping all its good properties. In this paper we briefly describe both protocols and compare them from the complexity point of view. In light of its simplicity, we propose to change the language standard to include DFP instead of SRP. Some alternative modifications of the Ada Reference Manual are pointed out in order to include DFP in the most straightforward way.

References

  1. Baker T.P., "Stack-Based Scheduling of Realtime Processes", Journal of Real-Time Systems, Volume 3, Issue 1 (March 1991), pp. 67--99. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. L. Sha, R. Rajkumar, and J.P. Lehoczky. "Priority inheritance protocols: An approach to real-time synchronisation". IEEE Transactions on Computers, 39(9):1175--1185, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. A. Burns. "A Deadline-Floor Inheritance Protocol for EDF Scheduled Real-Time Systems with Resource Sharing". Technical Report YCS-2012-476, Department of Computer Science, University of York, UK, 2012.Google ScholarGoogle Scholar
  4. A. Zerzelidis, A. Burns, A. J. Wellings. "Correcting the EDF protocol in Ada 2005". ACM Ada Letters -- IRTAW '07: Proceedings of the 13th international workshop on Real-time Ada, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. M.L. Fairbairn and A. Burns. "Implementing and Verifying EDF Preemption-Level Resource Control". LNCS 7308 -- Proceedings Reliable Software Technology - Ada-Europe, Springer, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. M. Aldea and M. González. "MaRTE OS: An Ada Kernel for Real-Time Embedded Applications". Proceedings of the International Conference on Reliable Software Technologies, Ada-Europe-2001, Leuven, Belgium, Lecture Notes in Computer Science, LNCS 2043, May, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. MaRTE OS home page: http://marte.unican.esGoogle ScholarGoogle Scholar
  8. M. Aldea, M. González and J.F. Ruiz. "Implementation of the Ada 2005 Task Dispatching Model in MaRTE OS and GNAT". LNCS 5570 -- Proceedings of the Reliable Software Technologies - Ada-Europe, Springer, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. M. Gutiérrez López, A. Burns, M. Aldea Rivas, M. González Harbour. "Performance comparison between the SRP and DFP synchronization protocols in MaRTE OS". Technical Report. University of Cantabria. Jan, 2013. URI: http://hdl.handle.net/10902/1509Google ScholarGoogle Scholar
  10. Michael T. Goodrich, Roberto Tamassia. "Data Structures & Algorithms in Java", John Wiley & Sons, Inc, 2006, pages 320--321. Google ScholarGoogle ScholarDigital LibraryDigital Library

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 33, Issue 2
    August 2013
    132 pages
    ISSN:1094-3641
    DOI:10.1145/2552999
    Issue’s Table of Contents

    Copyright © 2013 Authors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 8 November 2013

    Check for updates

    Qualifiers

    • research-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!