Federated Scheduling of Sporadic DAGs on Unrelated Multiprocessors
Artikel i vetenskaplig tidskrift, 2021

This paper presents a federated scheduling algorithm for implicit-deadline sporadic DAGs that execute on an unrelated heterogeneous multiprocessor platform. We consider a global work-conserving scheduler to execute a single DAG exclusively on a subset of the unrelated processors. Formal schedulability analysis to find the makespan of a DAG on its dedicated subset of the processors is proposed. The problem of determining each subset of dedicated unrelated processors for each DAG such that the DAG meets its deadline (i.e., designing the federated scheduling algorithm) is tackled by proposing a novel processors-to-task assignment heuristic using a new concept called processor value. Empirical evaluation is presented to show the effectiveness of our approach.

heterogeneous

scheduling

multiprocessor

work-conserving

sporadic

DAGs

Federated

unrelated

Författare

Petros Voudouris

Chalmers, Data- och informationsteknik, Datorteknik, Real-time and Computer Graphics Systems

Per Stenström

Chalmers, Data- och informationsteknik, Datorteknik, Computer Systems

Risat Pathan

Göteborgs universitet

Transactions on Embedded Computing Systems

1539-9087 (ISSN)

Vol. 20 5s 87

Ämneskategorier

Datorteknik

Datavetenskap (datalogi)

Datorsystem

DOI

10.1145/3477018

Mer information

Senast uppdaterat

2021-10-06