skip to main content
research-article

Lock-free protected types for real-time ada

Published:08 November 2013Publication History
Skip Abstract Section

Abstract

The Ravenscar profile defined by Ada prevents deadlock and starvation of conforming Ada programs on monoprocessor systems, allowing for better reasoning about real-time behavior. While defined in terms of mutual exclusion, we show Ada's protected types are general enough to allow an enhanced compiler to automatically generate appropriate lock-free synchronization code even on multiprocessors for some basic datastructures. In the context of real-time systems this allows for a more deterministic real-time response and improves the ability to statically analyze generated code.

References

  1. H.-J. Boehm. Transactional memory should be an implementation technique, not a programming interface. In Proceedings of the First USENIX conference on Hot topics in parallelism, HotPar'09, pages 15--15, Berkeley, CA, USA, 2009. USENIX Association. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. P. B. Hansen. History of programming languages--ii. chapter Monitors and Concurrent Pascal: a personal history, pages 121--172. ACM, New York, NY, USA, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. M. Herlihy. Wait-free synchronization. ACM Trans. Program. Lang. Syst., 13(1):124--149, Jan. 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. M. Herlihy and J. E. B. Moss. Transactional memory: architectural support for lock-free data structures. SIGARCH Comput. Archit. News, 21(2):289--300, May 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. K.-b. Yue, S. Davari, and T. Leibfried. Priority ceiling protocol in ada. In Proceedings of the conference on TRI-Ada '96: disciplined software development with Ada, TRI-Ada '96, pages 3--9, New York, NY, USA, 1996. ACM. 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 Author

    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!