Scheduling algorithms for extensions of the sporadic task model


Vincenzo Bonifaci, Gianlorenzo D'Angelo and Alberto Marchetti-Spaccamela

Presentation title

Scheduling algorithms for extensions of the sporadic task model

Authors

Vincenzo Bonifaci, Gianlorenzo D'Angelo and Alberto Marchetti-Spaccamela

Institution(s)

IASI-CNR, Gran Sasso Science Institute (GSSI) and Sapienza University of Rome

Presentation type

Presentation of a research group from one or more scientific institutions

Abstract

The sporadic task system is a well known model used by researchers who are working on developing algorithms and techniques for implementing real-time workloads. In the last years new models that extend the sporadic task system with significant challenges to this traditional perspective of real-time scheduling have been proposed. Some of them have been considered by us in the past (e.g. mixed criticality systems, sporadic DAG task models).

More recently we are focusing our attention on multicore and heterogeneous platforms and on the possibility to restrict task migration with affinity masks.

Our goal is to design and analyse efficient scheduling strategies for meeting specified end-to-end deadlines on distributed platforms.


Additional material

  • Presentation slides: [pdf]
  • Presentation slides part 2: "Multiprocessor real-time scheduling with hierarchical processor affinities": [pdf]