Hierarchical scheduling with ada 2005

  • Authors:
  • José A. Pulido;Santiago Urueña;Juan Zamorano;Tullio Vardanega;Juan A. de la Puente

  • Affiliations:
  • Departamento de Ingeniería de Sistemas Telemáticos (DIT), Universidad Politécnica de Madrid (UPM), Madrid, Spain;Departamento de Ingeniería de Sistemas Telemáticos (DIT), Universidad Politécnica de Madrid (UPM), Madrid, Spain;Departamento de Ingeniería de Sistemas Telemáticos (DIT), Universidad Politécnica de Madrid (UPM), Madrid, Spain;Dipartimento di Matematica Pura ed Applicata, Università di Padova, Padova, Italy;Departamento de Ingeniería de Sistemas Telemáticos (DIT), Universidad Politécnica de Madrid (UPM), Madrid, Spain

  • Venue:
  • Ada-Europe'06 Proceedings of the 11th Ada-Europe international conference on Reliable Software Technologies
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Hierarchical scheduling is a basic technique to achieve temporal isolation between applications in high-integrity systems when an integrated approach is opted for over traditional federation. While comparatively heavyweight approaches to hierarchical scheduling have been prevailing until now, the new scheduling features of Ada 2005 enable lighter-weight techniques to be used. This will expectedly result in increasing the efficiency and flexibility of hierarchical scheduling, thus enabling new ways to developing critical applications in Ada. The paper explores the new opportunities opened by Ada 2005 and proposes some concrete techniques for implementing hierarchical scheduling in the new version of the language.