skip to main content
research-article

Generalizing the EDF scheduling support in Ada 2005

Published:27 May 2010Publication History
Skip Abstract Section

Abstract

Ada 2005 has introduced a version of Baker's Stack Resource Protocol called the Preemption Level Control Protocol in order to support EDF scheduling. Baker's protocol is, however, a general protocol that can be used with a range of scheduling algorithms, for example any static job-level algorithm such as static values or a modified least laxity algorithm. This paper investigates the changes that would be needed to Ada 2005 to allow it to support user-defined scheduling, where the user can implement any scheduling approach that is compatible with Baker's algorithm.

References

  1. T. P. Baker. Stack-based scheduling of realtime processes. Real Time Systems, 3(1), 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. A Burns and A. J.Wellings. Concurrent and Real-Time Programming in Ada. Cambridge University Press, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. J.W.S. Liu. Real-Time Systems. Prentice Hall, 2000.Google ScholarGoogle Scholar

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 30, Issue 1
    April 2010
    150 pages
    ISSN:1094-3641
    DOI:10.1145/1806546
    Issue’s Table of Contents

    Copyright © 2010 Authors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 27 May 2010

    Check for updates

    Qualifiers

    • research-article
  • Article Metrics

    • Downloads (Last 12 months)1
    • Downloads (Last 6 weeks)0

    Other Metrics

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!