Efficient synchronization methods for LET-based applications on a Multi-Processor System on Chip

Breaban, Gabriela; Stuijk, Sander; Goossens, Kees

doi:10.23919/date.2017.7927271

Cited by 2 publications

(3 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently published research [6] follows a similar approach to ours. By mixing elements from two existing formalisms, one allowing the specification of timetriggered tasks and the other the specification of data flow actors, the expressiveness of the resulting modeling framework is comparable to that of Polygraph.…”

Section: Discussion and Related Workmentioning

confidence: 98%

“…The main difference is that Polygraph is a single formalism with decidable properties and algorithms to check them in practice. In [6], the impact of the combination of constraints from two different formalisms on their respective properties is not discussed, as the proposed approach is more focused on the performance evaluation. The experimental results the authors obtained are in favor of the modeling approach we have in common.…”

Section: Discussion and Related Workmentioning

confidence: 99%

“…The limitation of the existing data flow formalisms to model the considered systems is the lack of expressiveness regarding the synchronization on a common time scale for different components. Overcoming this limitation is the subject of recent research work [6]. Our goal is to extend an existing data flow formalism for which the consistency and liveness properties of a given model are decidable.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Data Flow Model with Frequency Arithmetic

Dubrulle

Gaston

Kosmatov

et al. 2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Data flow formalisms are commonly used to model systems in order to solve problems of buffer sizing and task scheduling. A prerequisite for static analysis of a modeled system is the existence of a periodic schedule in which the sizes of communication channels can be bounded for an unbounded execution (consistency), and that communication dependencies do not introduce a deadlock in such an execution (liveness). In the context of Cyber-Physical Systems, components are often interfaced with the physical world and have frequency constraints. The existing data flow formalisms lack expressiveness to fully cover the expected behavior of these components. We propose an extension to Synchronous Data Flow (SDF) formalism, called Polygraph, that includes frequency constraints and adjustable communication rates. We show that with these extensions, the conditions for a model to be consistent and live are no longer sufficient, and we extend the corresponding theorems with necessary and sufficient conditions to preserve these properties. We also introduce a framework to check the liveness of a Polygraph model, implemented in the tool DIVERSITY, along with preliminary experiments to validate this approach.

show abstract

Section: Discussion and Related Workmentioning

confidence: 98%

Section: Discussion and Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation