A runtime supervisor to support Ada tasking: rendezvous and delays

  • Authors:

  • G. A. Riccardi;T. P. Baker

  • Affiliations:

  • Department of Computer Science, Florida State University, Tallahassee, Florida;Department of Computer Science, Florida State University, Tallahassee, Florida

  • Venue:
  • SIGAda '85 Proceedings of the 1985 annual ACM SIGAda international conference on Ada
  • Year:
  • 1985

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes a simple and efficient approach to implementing the Ada operations of entry calls, conditional and timed entry calls, accept statements, selective wait statements and delay statements. This is accomplished by describing the tasking supervisor -- a collection of programs which control the tasking operations. Ada definitions of the data structures and the supervisor procedures are given. The semantics of the Ada tasking operations are related to the supervisor by following the description of tasking in chapter 9 of the Reference Manual for the Ada Programming Language (1983). The structure of the object code for various Ada source language constructs is given. The interaction between the Ada object code and the run-time supervisor is described in detail. The remaining tasking opertions are described in Part 1 of this report (Riccardi and Baker 1984).