Optimal and fast throughput evaluation of CSDF

Bruno Bodin; Alix Munier-Kordon; Benoît Dupont de Dinechin

doi:10.1145/2897937.2898056

Optimal and fast throughput evaluation of CSDF

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

The Synchronous Dataflow Graph (SDFG) and Cyclo-Static Dataflow 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.

Original language	English
Title of host publication	DAC '16: The 53rd Annual Design Automation Conference 2016
Number of pages	6
DOIs	https://doi.org/10.1145/2897937.2898056
Publication status	Published - 2016
Event	53rd Annual Design Automation Conference 2016 - Austin, United States Duration: 5 Jun 2016 → 9 Jun 2016 https://dac.com/content/53rd-dac

Conference

Conference	53rd Annual Design Automation Conference 2016
Abbreviated title	DAC 2016
Country/Territory	United States
City	Austin
Period	5/06/16 → 9/06/16
Internet address	https://dac.com/content/53rd-dac

Access to Document

10.1145/2897937.2898056

Bodin et al 2016 Optimal and fastAccepted author manuscript, 375 KB

http://dl.acm.org/citation.cfm?id=2898056

PAMELA: a Panoramic Approach to the Many-CorE LAndsape - from end-user to end-device: a holistic game-changing approach
Topham, N. (Principal Investigator), Franke, B. (Co-investigator) & O'Boyle, M. (Co-investigator)
EPSRC
1/03/13 → 15/10/18
Project: Research

Cite this

@inproceedings{36fdec481262426e820a05999cbf6a19,

title = "Optimal and fast throughput evaluation of CSDF",

abstract = "The Synchronous Dataflow Graph (SDFG) and Cyclo-Static Dataflow 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.",

author = "Bruno Bodin and Alix Munier-Kordon and Dinechin, \{Beno{\^i}t Dupont de\}",

year = "2016",

doi = "10.1145/2897937.2898056",

language = "English",

isbn = "978-1-4503-4236-0",

booktitle = "DAC '16: The 53rd Annual Design Automation Conference 2016",

note = "53rd Annual Design Automation Conference 2016, DAC 2016 ; Conference date: 05-06-2016 Through 09-06-2016",

url = "https://dac.com/content/53rd-dac",

}

TY - GEN

T1 - Optimal and fast throughput evaluation of CSDF

AU - Bodin, Bruno

AU - Munier-Kordon, Alix

AU - Dinechin, Benoît Dupont de

PY - 2016

Y1 - 2016

N2 - The Synchronous Dataflow Graph (SDFG) and Cyclo-Static Dataflow 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.

AB - The Synchronous Dataflow Graph (SDFG) and Cyclo-Static Dataflow 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.

U2 - 10.1145/2897937.2898056

DO - 10.1145/2897937.2898056

M3 - Conference contribution

SN - 978-1-4503-4236-0

BT - DAC '16: The 53rd Annual Design Automation Conference 2016

T2 - 53rd Annual Design Automation Conference 2016

Y2 - 5 June 2016 through 9 June 2016

ER -

Optimal and fast throughput evaluation of CSDF

Abstract

Conference

Access to Document

Fingerprint

Projects

PAMELA: a Panoramic Approach to the Many-CorE LAndsape - from end-user to end-device: a holistic game-changing approach

Cite this