2026-07-19T23:47:21Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:7151 2024-03-06T10:39:52Z ddc:004 open_access

Applying Real-Time Scheduling Theory to the Synchronous Data Flow Model of Computation Singh, Abhishek Ekberg, Pontus Baruah, Sanjoy Real-Time Systems Synchronous Dataflow (SDF) Hard Real-Time Streaming Dataflow Applications Algorithms Schedulability analysis techniques that are well understood within the real-time scheduling community are applied to the analysis of recurrent real-time workloads that are modeled using the synchronous data-flow graph (SDFG) model. An enhancement to the standard SDFG model is proposed, that permits the specification of a real-time latency constraint between a specified input and a specified output of an SDFG. A technique is derived for transforming such an enhanced SDFG to a collection of traditional 3-parameter sporadic tasks, thereby allowing for the analysis of systems of SDFG tasks using the methods and algorithms that have previously been developed within the real-time scheduling community for the analysis of systems of such sporadic tasks. The applicability of this approach is illustrated by applying prior results from real-time scheduling theory to construct an exact preemptive uniprocessor schedulability test for collections of recurrent processes that are each represented using the enhanced SDFG model. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Abhishek Singh and Pontus Ekberg and Sanjoy Baruah 2017 Is Part Of LIPIcs, Volume 76, 29th Euromicro Conference on Real-Time Systems (ECRTS 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ECRTS.2017.8 urn:nbn:de:0030-drops-71517 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECRTS.2017.8 eng https://creativecommons.org/licenses/by/3.0/legalcode