Global EDF scheduling of directed acyclic graphs on multiprocessor systems

Authors:
Manar Qamhieh;Frédéric Fauberteau;Laurent George;Serge Midonnet
Affiliations:
Université Paris-Est;ECE Paris - LACSC;Université Paris-Est;Université Paris-Est
Venue:
Proceedings of the 21st International conference on Real-Time Networks and Systems
Year:
2013

Citing 12
Cited 0

Dynamic scheduling of real-time tasks under precedence constraints

Real-Time Systems
Robustness Results Concerning EDF Scheduling upon Uniform Multiprocessors

IEEE Transactions on Computers
Sustainable Scheduling Analysis

RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Integrating job parallelism in real-time scheduling theory

Information Processing Letters
Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms

IEEE Transactions on Parallel and Distributed Systems
Sustainable Multiprocessor Scheduling of Sporadic Task Systems

ECRTS '09 Proceedings of the 2009 21st Euromicro Conference on Real-Time Systems
Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems

Real-Time Systems
Scheduling Parallel Real-Time Tasks on Multi-core Processors

RTSS '10 Proceedings of the 2010 31st IEEE Real-Time Systems Symposium
A survey of hard real-time scheduling for multiprocessor systems

ACM Computing Surveys (CSUR)
Multi-core Real-Time Scheduling for Generalized Parallel Task Models

RTSS '11 Proceedings of the 2011 IEEE 32nd Real-Time Systems Symposium
Supporting Soft Real-Time Parallel Applications on Multicore Processors

RTCSA '12 Proceedings of the 2012 IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
A Generalized Parallel Task Model for Recurrent Real-time Processes

RTSS '12 Proceedings of the 2012 IEEE 33rd Real-Time Systems Symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the problem of real-time scheduling of parallel tasks represented by a Directed Acyclic Graph (DAG) on multiprocessor architectures. We focus on Global Earliest Deadline First scheduling of sporadic DAG tasksets with constrained-deadlines on a system of homogeneous processors. Our contributions consist in analyzing DAG tasks by considering their internal structures and providing a tighter bound on the workload and interference analysis. This approach consists in assigning a local offset and deadline for each subtask in the DAG. We derive an improved sufficient schedulability test w.r.t. an existing test proposed in the state of the art. Then we discuss the sustainability of this test.