Liveness evaluation of a cyclo-static DataFlow graph

Abstract : Cyclo-Static DataFlow Graphs (CSDFG in short) is a formalism commonly used to model parallel applications composed by actors communicating through buffers. The liveness of a CSDFG ensures that all actors can be executed infinitely often. This property is clearly fundamental for the design of embedded applications. This paper aims to present first an original sufficient condition of liveness for a CSDFG. Two algorithms of polynomial-time for checking the liveness are then derived and compared to a symbolic execution of the graph. An original method to compute close-to-optimal buffer capacities ensuring liveness is also presented and experimentaly tested. The performance of our methods are comparable to those existing in the literature for industrial applications. However, they are far more effective on randomly generated instances, ensuring their scalability for future more complex applications and their possible implementation in a compiler.
Document type :
Conference papers
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.sorbonne-universite.fr/hal-00861992
Contributor : Thomas Hujsa <>
Submitted on : Monday, May 13, 2019 - 3:49:21 PM
Last modification on : Tuesday, June 18, 2019 - 3:40:03 PM

File

DAC 2013.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Mohamed Benazouz, Alix Munier-Kordon, Thomas Hujsa, Bruno Bodin. Liveness evaluation of a cyclo-static DataFlow graph. The 50th Annual Design Automation Conference, DAC 2013, Jun 2013, Austin, United States. pp.3:1-3:7, ⟨10.1145/2463209.2488736⟩. ⟨hal-00861992⟩

Share

Metrics

Record views

207

Files downloads

46