skip to main content
research-article

Towards a ravenscar extension for multi-processor systems

Published:27 May 2010Publication History
Skip Abstract Section

Abstract

The Ravenscar profile, originally designed for single processors, has proven remarkably useful for modelling verifiable real-time single-processor systems. New software demands increasing processing power, and multi-processor platforms are spreading as the answer to achieve the required performance. Embedded real-time systems are also subject to this trend, while keeping the need for the founding principles of Ravenscar: simplicity, efficiency, reliability, predictability, and analyz-ability. This paper proposes a simple extension to the Ravenscar profile to support multi-processor systems using a fully partitioned approach. The implementation of this scheme is simple, and it can be used to develop applications amenable to schedulability analysis.

References

  1. B. Andersson, S. Baruah, and J. Jonsson. Static-priority scheduling on multiprocessors. In RTSS'01: Proceedings of the 22nd IEEE Real-Time Systems Symposium. IEEE Computer Society, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. ARINC. ARINC Specification 653, Avionics Application Software Standard Interface. Aeronautical Radio, Inc, 2005.Google ScholarGoogle Scholar
  3. T. P. Baker. An analysis of fixed-priority schedulability on a multiprocessor. Real-Time Systems, 32(1{2):49--71, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. S. K. Baruah, N. K. Cohen, C. G. Plaxton, and D.A. Varvel. Proportionate progress: A notion of fairness in resource allocation. Algorithmica, 15:600--625, 1994.Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. J. Carpenter, S. Funk, P. Holman, A. Srinivasan, J. Anderson, and Sanjoy Baruah. A categorization of real-time multiprocessor scheduling problems and algorithms. In Handbook on Scheduling Algorithms, Methods, and Models. Chapman Hall/CRC, Boca, 2004.Google ScholarGoogle Scholar
  6. M. Joseph and P. Pandya. Finding response times in real-time systems. BCS Computer Journal, 29(5):390--395, 1986.Google ScholarGoogle ScholarCross RefCross Ref
  7. C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM, 20(1), 1973. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Y. Oh and H. Son. Tight performance bounds of heuristics for a real-time scheduling problem. Technical report, Department of Computer Science, University of Virginia, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. José F. Ruiz. GNAT Pro for on-board mission-critical space applications. In Ada-Europe 2005, 10th Ada-Europe International Conference on Reliable Software Technologies, volume 3555 of Lecture Notes in Computer Science, pages 248--259. Springer, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. A. J. Wellings and A. Burns. Beyond Ada 2005: allocating tasks to processors in SMP systems. Ada Letters, XXVII(2):75--81, 2007. 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 30, Issue 1
    April 2010
    150 pages
    ISSN:1094-3641
    DOI:10.1145/1806546
    Issue’s Table of Contents

    Copyright © 2010 Author

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 27 May 2010

    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!