2014•Unpublished venueRequires access

An Approximate Method for Throughput Evaluation of Cyclo-static Dataflow Programs

Pascal J. Aubry, Mohamed Benazouz, Renaud Sirdey

Abstract

Because of the multiplication of multi-core architecture, dataflow programming languages regained interest during the last years. In the case of massively multi-core embedded system architectures, the computation of throughput is used for buffer sizing under time constraints. This paper introduces an approximate method for the throughput evaluation for cyclostatic dataflow graphs.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Dataflow, Computer science, Throughput, Parallel computing, Dataflow architecture, Computation, Massively parallel, Multi-core processor