Login

Implementing Multicore Real-Time Scheduling Algorithms Based on Task Splitting Using Ada 2012
Ref: HURRAY-TR-100301       Publication Date: 14 to 18, Jun, 2010

Implementing Multicore Real-Time Scheduling Algorithms Based on Task Splitting Using Ada 2012

Ref: HURRAY-TR-100301       Publication Date: 14 to 18, Jun, 2010

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.

Authors:
Björn Andersson
,
Luis Miguel Pinho


15th International Conference on Reliable Software Technologies (Ada-Europe 2010), Springer Berlin Heidelberg, pp 54-67.
Valencia, Spain.

DOI:10.1007/978-3-642-13550-7_4.
WOS ID: 000279558700004.
ISBN: 978-3-642-13549-1.



Record Date: 10, Apr, 2010