skip to main content
research-article

Ada 2012: resource sharing and multiprocessors

Published:11 June 2013Publication History
Skip Abstract Section

Abstract

As from Ada 2005, the language has supported different dispatching policies including fixed priority (FP) and earliestdeadline first (EDF). EDF dispatching can be applied across the whole range of priorities or across a restricted range. In this way, EDF scheduling is integrated into a FP framework. Baker's Stack Resource Policy (SRP) is also integrated with Ada's immediate priority ceiling protocol to support resource sharing using protected objects. However, with the introduction of support for global, partitioned and cluster scheduling for multiprocessor systems, the use of protected objects in applications needs to be re-evaluated. This is because Ada does not completely define how protected objects are accessed in a multiprocessor environment and because the SRP cannot be directly applied to multiprocessors.

This paper reviews the currently available multiprocessor resource allocation policies and analyzes their applicability to Ada. It proposes some new Ada mechanisms that would facilitate the programming of a variety of protected object access protocols.

References

  1. T. P. Baker. Stack-based scheduling for realtime processes. Real-Time Syst., 3:67--99, March 1991 Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. A. Block, H. Leontyev, B. B. Brandenburg, and J. H. Anderson. A flexible real-time locking protocol for multiprocessors. In Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA '07, pages 47--56, Washington, DC, USA, 2007. IEEE Computer Society. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. B. B. Brandenburg, J. M. Calandrino, A. Block, H. Leontyev, and J. H. Anderson. Real-time synchronization on multiprocessors: To block or not to block, to suspend or spin? In Proceedings of the 2008 IEEE Real-Time and Embedded Technology and Applications Symposium, pages 342--353, Washington, DC, USA, 2008. IEEE Computer Society. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. B.B. Brandenburg and J.H. Anderson. Optimality results for multiprocessor real-time locking. In Real-Time Systems Symposium (RTSS), 2010 IEEE 31st, pages 49--60, 30 2010-dec. 3 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. B.B. Brandenburg and J.H. Anderson. Real-time resource sharing under cluster scheduling. In EMSOFT, page submitted, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Y. Chang, R. I. Davis, and A. J.Wellings. Reducing queue lock pessimism in multiprocessor schedulability analysis. In Proceedings of 18th International Conference on Real-Time and Network Systems (RTNS), pages 99--108, 2010.Google ScholarGoogle Scholar
  7. Y. Chang, R.I. Davis, and A.J. Wellings. Improved schedulability analysis for multiprocessor systems with resource sharing. techreport YCS-2010-454, University of York, 2010.Google ScholarGoogle Scholar
  8. A. Easwaran and B. Andersson. Resource sharing in global fixed-priority preemptive multiprocessor scheduling. In IEEE Real-Time Systems Symposium, pages 377--386, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. P. Gai, G. Lipari, and M. Di Natale. Minimizing memory utilization of real-time task sets in single and multi-processor systems-on-a-chip. In Real-Time Systems Symposium, 2001. (RTSS 2001). Proceedings. 22nd IEEE, pages 73--83, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. P. Gai, M. Di Natale, G. Lipari, A. Ferrari, C. Gabellini, and P. Marceca. A comparison of MPCP and MSRP when sharing resources in the janus multiple-processor on a chip platform. In Proceedings of the The 9th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS '03, pages 189--, Washington, DC, USA, 2003. IEEE Computer Society. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. M. G. Harbour M. A. Rivas. Application-defined scheduling in Ada. In Proceedings of IRTAW 12, Ada Letters, Vol XXIII(4), pages 42--51, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. R. Rajkumar. Synchronization in Real-Time Systems: A Priority Inheritance Approach. Kluwer Academic Publishers, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. R. Rajkumar, L. Sha, and J.P. Lehoczky. Real-time synchronization protocols for multiprocessors. In Real-Time Systems Symposium, 1988., Proceedings., pages 259--269, 1988.Google ScholarGoogle ScholarCross RefCross Ref
  14. R. Rajkumar, L. Sha, and J.P. Lehoczky. Real-time synchronization protocols for shared memory multiprocessors. In Proceedings of the 10th International Conference on Distributed Computing, pages 116--125, 1990.Google ScholarGoogle ScholarCross RefCross Ref
  15. J. Ras and A. M. K. Cheng. An evaluation of the dynamic and static multiprocessor priority ceiling protocol and the multiprocessor stack resource policy in an SMP system. In Proceedings of the 2009 15th IEEE Symposium on Real-Time and Embedded Technology and Applications, RTAS '09, pages 13--22, Washington, DC, USA, 2009. IEEE Computer Society. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. P. Rogers and A.J. Wellings. Openada: Compile-time reflection for Ada 95. In Albert Llamos and Alfred Strohmeier, editors, Reliable Software Technologies - Ada-Europe 2004, volume 3063 of Lecture Notes in Computer Science, pages 166--177. Springer Berlin / Heidelberg, 2004.Google ScholarGoogle Scholar
  17. A. Zerzelidis, A. Burns, and A. J. Wellings. Correcting the EDF protocol in Ada 2005. Ada Letters, XXVII:18--22, April 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Ada 2012: resource sharing and multiprocessors

        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 1
          April 2013
          171 pages
          ISSN:1094-3641
          DOI:10.1145/2492312
          Issue’s Table of Contents

          Copyright © 2013 Authors

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 11 June 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!