2026-07-26T05:17:09Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:18030 2024-03-06T11:01:16Z ddc:004 open_access

Scheduling and Compiling Rate-Synchronous Programs with End-To-End Latency Constraints Bourke, Timothy Bregeon, Vincent Pouzet, Marc synchronous-reactive integer linear programming code generation We present an extension of the synchronous-reactive model for specifying multi-rate systems. A set of periodically executed components and their communication dependencies are expressed in a Lustre-like programming language with features for load balancing, resource limiting, and specifying end-to-end latencies. The language abstracts from execution time and phase offsets. This permits simple clock typing rules and a stream-based semantics, but requires each component to execute within an overall base period. A program is compiled to a single periodic task in two stages. First, Integer Linear Programming is used to determine phase offsets using standard encodings for dependencies and load balancing, and a novel encoding for end-to-end latency. Second, a code generation scheme is adapted to produce step functions. As a result, components are synchronous relative to their respective rates, but not necessarily simultaneous relative to the base period. This approach has been implemented in a prototype compiler and validated on an industrial application. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Timothy Bourke and Vincent Bregeon and Marc Pouzet 2023 Is Part Of LIPIcs, Volume 262, 35th Euromicro Conference on Real-Time Systems (ECRTS 2023) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ECRTS.2023.1 urn:nbn:de:0030-drops-180301 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECRTS.2023.1 eng https://creativecommons.org/licenses/by/4.0/legalcode