2026-07-22T16:01:39Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:13941 2024-03-06T10:53:20Z ddc:004 open_access

Hard Real-Time Stationary GANG-Scheduling Ueter, Niklas Günzel, Mario von der Brüggen, Georg Chen, Jian-Jia Real-Time Systems Gang Scheduling Parallel Computing Scheduling Algorithms The scheduling of parallel real-time tasks enables the efficient utilization of modern multiprocessor platforms for systems with real-time constrains. In this situation, the gang task model, in which each parallel sub-job has to be executed simultaneously, has shown significant performance benefits due to reduced context switches and more efficient intra-task synchronization. In this paper, we provide the first schedulability analysis for sporadic constrained-deadline gang task systems and propose a novel stationary gang scheduling algorithm. We show that the schedulability problem of gang task sets can be reduced to the uniprocessor self-suspension schedulability problem. Furthermore, we provide a class of partitioning algorithms to find a stationary gang assignment and show that it bounds the worst-case interference of each task. To demonstrate the effectiveness of our proposed approach, we evaluate it for implicit-deadline systems using randomized task sets under different settings, showing that our approach outperforms the state-of-the-art. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Niklas Ueter and Mario Günzel and Georg von der Brüggen and Jian-Jia Chen 2021 Is Part Of LIPIcs, Volume 196, 33rd Euromicro Conference on Real-Time Systems (ECRTS 2021) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ECRTS.2021.10 urn:nbn:de:0030-drops-139410 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECRTS.2021.10 eng https://creativecommons.org/licenses/by/4.0/legalcode