Reservation-Based Federated Scheduling for Parallel Real-Time Tasks

Document Type

Conference Proceeding

Publication Date

1-4-2019

Abstract

Multicore systems are increasingly utilized in real-time systems in order to address the high computational demands. To fully exploit the advantages of multicore processing, possible intra-task parallelism modeled as a directed acyclic graph (DAG) must be utilized efficiently. This paper considers the scheduling problem for parallel real-time tasks with constrained and arbitrary deadlines. In contrast to prior work in this area, it generalizes federated scheduling and proposes a novel reservation-based approach. Namely, we propose a reservation-based federated scheduling strategy that reduces the problem of scheduling arbitrary-deadline DAG task sets to the problem of scheduling arbitrary-deadline sequential task sets by allocating reservation servers. We provide the general reservation design for sporadic parallel tasks, such that any scheduling algorithm and analysis for sequential tasks with arbitrary deadlines can be used to execute the allocated reservation servers of parallel tasks. Moreover, the proposed reservation-based federated scheduling algorithms provide constant speedup factors with respect to any optimal scheduler for arbitrary-deadline DAG task sets. We demonstrate via numerical and empirical experiments that our algorithms are competitive with the state of the art.

Identifier

85061558999 (Scopus)

ISBN

[9781538679074]

Publication Title

Proceedings Real Time Systems Symposium

External Full Text Location

https://doi.org/10.1109/RTSS.2018.00061

ISSN

10528725

First Page

482

Last Page

494

Volume

2018-December

Grant

SFB876

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS