Work

Optimal and fast throughput evaluation of CSDF

Year: 2016

Type: conference-paper

Abstract: The Synchronous Dataow Graph (SDFG) and Cyclo-Static Dataow Graph (CSDFG) are two well-known models, used practically by industry for many years, and for which there is a large number of analysis techniques. Yet, basic problems such as the throughput computation or the liveness evaluation are not well solved, and their complexity is still unknown. In this paper, we propose K-Iter, an iterative algorithm based on K-periodic scheduling to compute the throughput of a CSDFG. By using this technique, we are able to compute in less than a minute the throughput of industry applications for which no result was available before.

Source: Proceedings - ACM IEEE Design Automation Conference

DOI: 10.1145/2897937.2898056

Authors: Bruno Bodin, Alix Munier-Kordon, Benoît Dupont de Dinechin

Institutions: University of Edinburgh, Sorbonne Université

Language: English

Topic: Embedded Systems Design Techniques

Subfield: Hardware and Architecture

Field: Computer Science

Domain: Physical Sciences

SDG: Industry, innovation and infrastructure

Open Access status: green

OpenAlex ID: W2404982175

FWCI: 1.027

Cites: 17

Cited by: 15

Related to: 10