Restricted tasking models

  • Authors:
  • A. Burns;A. J. Wellings

  • Affiliations:
  • Real-Time Systems Research Group, Department of Computer Science, University of York, UK;Real-Time Systems Research Group, Department of Computer Science, University of York, UK

  • Venue:
  • IRTAW '97 Proceedings of the eighth international workshop on Real-Time Ada
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

High-integrity systems rarely make use of high-level language features such as Ada tasking. In this paper, simple language profiles (of Ada 95 concurrency features) are developed that are appropriate for various levels of integrity. A level-0 model (collection of Ada95 features) defines a minimal language profile and delivers deterministic (non-preemptive) behaviour. Scheduling is undertaken as part of the application and can thus be inspected and verified. Five other models are also presented that give different levels of expressive power. The motivation for this paper is to try and define models that would become de facto standards and that would be directly supported by kernel vendors and other tool suppliers.