A Round Robin Scheduling Policy for Ada

  • A. Burns
  • M. González Harbour
  • A. J. Wellings
Conference paper

DOI: 10.1007/3-540-44947-7_25

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2655)
Cite this paper as:
Burns A., González Harbour M., Wellings A.J. (2003) A Round Robin Scheduling Policy for Ada. In: Rosen JP., Strohmeier A. (eds) Reliable Software Technologies — Ada-Europe 2003. Ada-Europe 2003. Lecture Notes in Computer Science, vol 2655. Springer, Berlin, Heidelberg

Abstract

Although Ada defines a number of mechanisms for specifying scheduling policies, only one, Fifo_Within_Priorities is guaranteed to be supported by all implementations of the Real-Time Systems Annex. Many applications have a mixture of real-time and non real-time activities. The natural way of scheduling non real-time activities is by time sharing the processor using Round Robin Scheduling. Currently, the only way of achieving this is by incorporating yield operations in the code. This is ad hoc and intrusive. The paper proposes a new scheduling policy which allows one or more priority levels to be identified as round robin priorities. A task whose base priority is set to one of these levels is scheduled in a round robin manner with a user-definable quantum.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • A. Burns
    • 1
  • M. González Harbour
    • 2
  • A. J. Wellings
    • 1
  1. 1.Department of Computer ScienceUniversity of YorkUK
  2. 2.Departamento de Electrónica y ComputadoresUniversidad de CantabriaSpain

Personalised recommendations