Lustre, Fast First, and Fresh

The rate-synchronous model formalizes an industrial approach for composing Lustre nodes that execute at different rates. Such programs are compiled to cyclic sequential code in two steps. First, an integer linear program is solved to assign each component to a phase relative to its period. Second, t...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE embedded systems letters Ročník 17; číslo 2; s. 119 - 122
Hlavní autoři: Bourke, Timothy, Pouzet, Marc
Médium: Journal Article
Jazyk:angličtina
Vydáno: IEEE 01.04.2025
Institute of Electrical and Electronics Engineers
Témata:
Clocks
Codes
Computer Science
Dataflow synchronous programming
Mathematical models
Pipelines
Reactive power
Schedules
Semantics
Streams
Switches
Syntactics
time-centric reactive software
Dataflow Synchronous Programming
Time-Centric Reactive Software
ISSN:1943-0663, 1943-0671
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The rate-synchronous model formalizes an industrial approach for composing Lustre nodes that execute at different rates. Such programs are compiled to cyclic sequential code in two steps. First, an integer linear program is solved to assign each component to a phase relative to its period. Second, the corresponding step functions are ordered for execution within a cycle of the generated code. By default, programs are deterministic: for any valid schedule, the generated code calculates the values decreed by the source dataflow semantics at the specified rates. In practice, though, specifying precise values in the source program is sometimes unnecessary, impracticable, and overly constraining. In this case, the integer linear programming constraints can be relaxed, though not necessarily completely, and their solution decides which dataflow semantics applies. Care is still required to ensure that code generation remains deterministic.
ISSN:1943-0663
1943-0671
DOI:10.1109/LES.2024.3498932