Toward real-time performance benchmarks for Ada
Communications of the ACM
Timing variation in dual loop benchmark
ACM SIGAda Ada Letters
Real-Time Scheduling Theory and Ada
Computer
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
ACM SIGAda Ada Letters
Fixed-Priority Sensitivity Analysis for Linear Compute Time Models
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
Rate monotonic scheduling provides analytic techniques that allow the feasibility and processor utilization of a set of periodically scheduled tasks to be computed. However, the scheduling model must be adapted to take into account specific implementation details. Moreover, a model is not the same thing as the actual system; the accuracy and reliability of a model must be verified. This paper presents an Ada coding template for rate monotonic scheduling and models for that template. A series of experiments is described whose purpose was to compare the analytic predictions and measured performance for some sample task sets. Predicted and measured values differed by less than about 3% in all cases.