Stretching algorithm for global scheduling of real-time DAG tasks

DOI10.1007/S11241-018-9311-1zbMATH Open1436.68072OpenAlexW2806457458MaRDI QIDQ777064

Serge Midonnet, Manar Qamhieh, Laurent George

Publication date: 13 July 2020

Published in: Real-Time Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11241-018-9311-1

zbMATH Keywords

directed acyclic graphsparallel tasksresource augmentation boundglobal preemptive schedulinghomogeneous multiprocessor

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Multi-core real-time scheduling for generalized parallel task models

Related Items (2)

A survey on real-time DAG scheduling, revisiting the Global-Partitioned Infinity War ⋮ Characterizations of parallel real-time workloads

Uses Software

• SHUM-uCOS
• YARTISS

This page was built for publication: Stretching algorithm for global scheduling of real-time DAG tasks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q777064)