### Abstract

Original language | Undefined |
---|---|

Title of host publication | Proceedings of the 11th ACM/IEEE International Conference on Formal Methods and Models for Codesign, MEMOCODE 2013 |

Place of Publication | USA |

Publisher | IEEE Computer Society |

Pages | 35-46 |

Number of pages | 12 |

ISBN (Print) | 978-1-4799-0903-2 |

Publication status | Published - Oct 2013 |

### Publication series

Name | |
---|---|

Publisher | IEEE Computer Society |

### Keywords

- Performance analysis
- Synchronous Data Flow
- METIS-300052
- IR-87981
- Approximation
- EWI-23789

### Cite this

*Proceedings of the 11th ACM/IEEE International Conference on Formal Methods and Models for Codesign, MEMOCODE 2013*(pp. 35-46). USA: IEEE Computer Society.

}

*Proceedings of the 11th ACM/IEEE International Conference on Formal Methods and Models for Codesign, MEMOCODE 2013.*IEEE Computer Society, USA, pp. 35-46.

**Back to basics: homogeneous representations of multi-rate synchronous dataflow graphs.** / de Groote, Robert; Holzenspies, P.K.F.; Kuper, Jan; Broersma, Haitze J.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Back to basics: homogeneous representations of multi-rate synchronous dataflow graphs

AU - de Groote, Robert

AU - Holzenspies, P.K.F.

AU - Kuper, Jan

AU - Broersma, Haitze J.

PY - 2013/10

Y1 - 2013/10

N2 - Exact temporal analyses of multi-rate synchronous dataflow (MRSDF) graphs, such as computing the maximum achievable throughput, or sufficient buffer sizes required to reach a minimum throughput, require a homogeneous representation called a homogeneous synchronous dataflow (HSDF) graph. The size of such an HSDF graph may, in the worst case, be exponential in the size of the MRSDF graph. In this paper, we revisit the transformation from MRSDF to HSDF, and show how this transformation may be done either exactly or approximately. The approximate transformation gives both an optimistic and a pessimistic HSDF graph, each of which has the same size as the MRSDF graph. We furthermore show how strict lower and upper bounds on throughput, or on the buffer sizes required to reach a minimum throughput, may be obtained from these approximating graphs.

AB - Exact temporal analyses of multi-rate synchronous dataflow (MRSDF) graphs, such as computing the maximum achievable throughput, or sufficient buffer sizes required to reach a minimum throughput, require a homogeneous representation called a homogeneous synchronous dataflow (HSDF) graph. The size of such an HSDF graph may, in the worst case, be exponential in the size of the MRSDF graph. In this paper, we revisit the transformation from MRSDF to HSDF, and show how this transformation may be done either exactly or approximately. The approximate transformation gives both an optimistic and a pessimistic HSDF graph, each of which has the same size as the MRSDF graph. We furthermore show how strict lower and upper bounds on throughput, or on the buffer sizes required to reach a minimum throughput, may be obtained from these approximating graphs.

KW - Performance analysis

KW - Synchronous Data Flow

KW - METIS-300052

KW - IR-87981

KW - Approximation

KW - EWI-23789

M3 - Conference contribution

SN - 978-1-4799-0903-2

SP - 35

EP - 46

BT - Proceedings of the 11th ACM/IEEE International Conference on Formal Methods and Models for Codesign, MEMOCODE 2013

PB - IEEE Computer Society

CY - USA

ER -