Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Static-Priority Scheduling on Multiprocessors
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Tight Performance Bounds of Heuristics for a Real-Time Scheduling Problem
Tight Performance Bounds of Heuristics for a Real-Time Scheduling Problem
An Analysis of Fixed-Priority Schedulability on a Multiprocessor
Real-Time Systems
Beyond Ada 2005: allocating tasks to processors in SMP systems
IRTAW '07 Proceedings of the 13th international workshop on Real-time Ada
GNAT pro for on-board mission-critical space applications
Ada-Europe'05 Proceedings of the 10th Ada-Europe international conference on Reliable Software Technologies
Design and implementation of a Ravenscar extension for multiprocessors
Ada-Europe'11 Proceedings of the 16th Ada-Europe international conference on Reliable software technologies
Support for multiprocessor platforms
ACM SIGAda Ada Letters
TTF-ravenscar: a profile to support reliable high-integrity multiprocessor ada applications
ACM SIGAda Ada Letters
Going real-time with Ada 2012 and GNAT
ACM SIGAda Ada Letters
On real-time partitioned multicore systems
ACM SIGAda Ada Letters
| Hi-index | 0.00 |
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.