INCORPORATING UNBOUNDED ALGORITHMS INTO PREDICTABLE REAL-TIME SYSTEMS

N C Audsley, A Burns, M F Richardson, A J Wellings

Research output: Contribution to journalArticlepeer-review

Abstract

The incorporation of unbounded components (i,e. software modules that cannot be analysed to produce realistic worst case execution times) into hard real-time applications has been recognized as a key issue for the next generation of systems. We present a system model that caters for the three main approaches to integrating unbounded components - imprecise computation, sieve functions and multiple versions. This model is feasible because it is supported by schedulability tests that will guarantee the bounded tasks. These tests are defined in the paper. A simple computational model thal uses preemptive priority-based dispatching is required. The widespread use of techniques such as imprecise computation will only happen if they are integrated into standard software engineering methods. We therefore show how the techniques can be realized in Ada 9X.

Original languageEnglish
Pages (from-to)80-89
Number of pages10
JournalComputing systems
Volume8
Issue number2
Publication statusPublished - Apr 1993

Keywords

  • REAL-TIME COMPUTING
  • UNBOUNDED ALGORITHMS
  • IMPRECISE COMPUTATION
  • SIEVE FUNCTIONS
  • MULTIPLE VERSIONS

Cite this