Federated Scheduling of Sporadic DAGs on Unrelated Multiprocessors
Journal article, 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.

Federated

work-conserving

sporadic

scheduling

unrelated

DAGs

heterogeneous

multiprocessor

Author

Petros Voudouris

Chalmers, Computer Science and Engineering (Chalmers), Computer Engineering (Chalmers)

Per Stenström

Chalmers, Computer Science and Engineering (Chalmers), Computer Engineering (Chalmers)

Risat Pathan

University of Gothenburg

Transactions on Embedded Computing Systems

1539-9087 (ISSN) 15583465 (eISSN)

Vol. 20 5s 87

Meeting Challenges in Computer Architecture (MECCA)

European Commission (EC) (EC/FP7/340328), 2014-02-01 -- 2019-01-31.

Areas of Advance

Information and Communication Technology

Subject Categories

Control Engineering

Computer Science

Computer Systems

DOI

10.1145/3477018

More information

Latest update

1/17/2022