Determination of the Underlying Task Scheduling Algorithm for an Ada Runtime System
Abstract
The purpose of this thesis investigation was to determine whether the task scheduling algorithm of an Ada compiler could be detected using a suite of Ada programs. This was done by identifying the task parameters and algorithm characteristics which differentiate one scheduling algorithm from the others. After these parameters and characteristics were identified, a set of test cases was developed to encompass the various parameter relationships required to detect the execution of individual algorithms. These test cases were modeled using Ada programs. Then, the programs were compiled and executed using several Ada compilers where the task scheduling algorithms of five run-time systems was known. The execution results were analyzed to determine whether the Ada programs were capable of revealing the task scheduling algorithm used by the Ada run-time system. This analysis showed that the detection of five scheduling schemes is possible using a single Ada program. Recommendations are made to improve the current Ada program leading to an automated tool in which the user analysis could be removed. (AW)
Document Details
- Document Type
- Technical Report
- Publication Date
- Dec 01, 1989
- Accession Number
- ADA215880
Entities
People
- Gary A. Whitted
Organizations
- Air Force Institute of Technology