skip to main content
research-article

Supporting execution on multiprocessor platforms

Published:27 May 2010Publication History
Skip Abstract Section

Abstract

Multiprocessor platforms are becoming the norm for more powerful embedded real-time systems. Although Ada allows its tasks to be executed on such platforms it provides no explicit support that allows programmers to map tasks to processors. If Ada is going to be an effective language for multiprocessor systems then it needs to address the mapping issue that will allow the programmer to express their requirements for task to processor affinity. A number of different mapping and scheduling approaches are advocated in the scheduling literature. The primitives in the language should allow these schemes to be directly supported. In this paper we propose a minimum set of such primitives, with the aim of initiating a debate that will lead to an agreed language change that can be accepted within the Ada community.

References

  1. B. Andersson and K. Bletsas. Sporadic multiprocessor scheduling with few preemptions. In Euromicro Conference on Real-Time Systems (ECRTS), pages 243--252, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. B. Andersson and J. Jonsson. Fixed-priority preemptive multiprocessor scheduling: to partition or not to partition. In Proceedings of the International Conference on Real-Time Computing Systems and Applications, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. S. Baruah, N. Cohen, G. Plaxton, and D. Varvel. Proportionate progress: A notion of fairness in resource allocation. Algorithmica, 15(6):600--625, 1996.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. R. Rajkumar, L. Sha, and J.P. Lehoczky. Real-time synchronization protocols for multiprocessors. In Proceedings 9th IEEE Real-Time Systems Symposium, pages 259--269, 1988.Google ScholarGoogle ScholarCross RefCross Ref
  5. J. Real and S. Mitchell. Beyond ada 2005 session report. In Proceedings of IRTAW 13, Ada Letters, XXVII(2), pages 124--126, 2007.Google ScholarGoogle Scholar
  6. N. Shavit and D. Touitou. Software transactional memory. In Proceedings of the 14th ACM Symposium on Principles of Distributed Computing, pages 204--213, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. K. Shinpei and Y. Nobuyuki. Portioned edf-based scheduling on multiprocessors. In EMSOFT, pages 139--148, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. M. Ward and N.C Audsley. Suggestions for stream based parallel systems in ada. In Proceedings of IRTAW 13, Ada Letters, XXVII(2), pages 33--138, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. A.J. Wellings and A. Burns. Beyond ada 2005: allocating tasks to processors in smp systems. In Proceedings of IRTAW 13, Ada Letters, XXVII(2), pages 75--81, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. A.J. Wellings, A.H. Malik, N.C. Audsley, and A. Burns. Ada and cc-NUMA architectures: What can be done with Ada 2005. In submitted to IRTAW 14, 2009. 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 Authors

    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!