Real-Time Scheduling Theory and Ada

Abstract

The Ada tasking model was intended to support the management of concurrency in a priority-driven scheduling environment. In this paper, we review some important results of a priority-based scheduling theory, illustrate its applications with examples, discuss its implications for the ADA tasking model, and suggest workarounds that permit us to implement analytical scheduling algorithms within the existing framework of Ada. The scheduling algorithms and theories developed under this project and at Carnegie Mellon provide an analytical basis using a generic avionics application, a generic missile application, and a generic inertial navigation system. This paper summarizes some of the scheduling approaches being studied and shows how they can be applied in an Ada context.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1989
Accession Number
ADA211397

Entities

People

  • John B. Goodenough
  • Lui R. Sha

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Computations
  • Computer Programming
  • Computer Science
  • Department Of Defense
  • Engineering
  • Executives
  • Inertial Navigation
  • Inertial Navigation Systems
  • Information Exchange
  • Language
  • Local Area Networks
  • Navigation
  • Scheduling (Production)
  • Software Development
  • Technical Information Centers

Fields of Study

  • Computer science

Readers

  • Operations Research
  • Parallel and Distributed Computing.
  • Software Engineering.