Ada Validation Tests for Rate Monotonic Scheduling Algorithms
Abstract
This report presents a set of tests for checking whether an Ada runtime system properly supports certain rate monotonic scheduling algorithms, specifically, the basic inheritance and priority ceiling protocols. These tests are intended to be used by vendors and by users to validate implementations of these protocols. The report describes the tests and how they are to be used. The source code is available electronically.
Document Details
- Document Type
- Technical Report
- Publication Date
- Feb 01, 1992
- Accession Number
- ADA253325
Entities
People
- John B. Goodenough
- Keith A. Kohout
- Kent Meyer
Organizations
- Carnegie Mellon University