Implementing multicore real-time scheduling algorithms based on task splitting using ada 2012

  • Authors:
  • Björn Andersson;Luís-Miguel Pinho

  • Affiliations:
  • CISTER-ISEP Research Centre, Polytechnic Institute of Porto, Portugal;CISTER-ISEP Research Centre, Polytechnic Institute of Porto, Portugal

  • Venue:
  • Ada-Europe'10 Proceedings of the 15th Ada-Europe international conference on Reliable Software Technologies
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Multiprocessors, particularly in the form of multicores, are becoming standard building blocks for executing reliable software. But their use for applications with hard real-time requirements is non-trivial. Well-known real-time scheduling algorithms in the uniprocessor context (Rate-Monotonic [1] or Earliest-Deadline-First [1]) do not perform well on multiprocessors. For this reason the scientific community in the area of real-time systems has produced new algorithms specifically for multiprocessors. In the meanwhile, a proposal [2] exists for extending the Ada language with new basic constructs which can be used for implementing new algorithms for real-time scheduling; the family of task splitting algorithms is one of them which was emphasized in the proposal [2]. Consequently, assessing whether existing task splitting multiprocessor scheduling algorithms can be implemented with these constructs is paramount. In this paper we present a list of state-of-art task-splitting multiprocessor scheduling algorithms and, for each of them, we present detailed Ada code that uses the new constructs.