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.
- B. Andersson and K. Bletsas. Sporadic multiprocessor scheduling with few preemptions. In Euromicro Conference on Real-Time Systems (ECRTS), pages 243--252, 2008. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Cross Ref
- J. Real and S. Mitchell. Beyond ada 2005 session report. In Proceedings of IRTAW 13, Ada Letters, XXVII(2), pages 124--126, 2007.Google Scholar
- 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 Scholar
Digital Library
- K. Shinpei and Y. Nobuyuki. Portioned edf-based scheduling on multiprocessors. In EMSOFT, pages 139--148, 2008. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
Recommendations
LLF Schedulability Analysis on Multiprocessor Platforms
RTSS '10: Proceedings of the 2010 31st IEEE Real-Time Systems SymposiumLLF (Least Laxity First) scheduling, which assigns a higher priority to a task with smaller laxity, has been known as an optimal preemptive scheduling algorithm on a single processor platform. However, its characteristics upon multiprocessor platforms ...
Laxity dynamics and LLF schedulability analysis on multiprocessor platforms
LLF (Least Laxity First) scheduling, which assigns a higher priority to a task with a smaller laxity, has been known as an optimal preemptive scheduling algorithm on a single processor platform. However, little work has been made to illuminate its ...
Support for multiprocessor platforms
Multiprocessor platforms are becoming the norm for more powerful embedded real-time systems. Although Ada allows its tasks to be executed on such platforms, until recently it has provided no explicit support. The new revision of Ada now provides ...






Comments