Efficient Computation of Buffer Capacities for Cyclo-Static Dataflow Graphs

Proceedings - Design Automation Conference- China

doi 10.1109/dac.2007.375247

Full Text

Abstract

Available in

Categories

Systems Engineering

Electronic Engineering

Computer Science Applications

Date

June 1, 2007

Authors

Maarten H. Wiggers

Marco J.G. Bekooij

Gerard J.M. Smit

Publisher

IEEE

Related search

Quasi-Static Scheduling of Reconfigurable Dataflow Graphs for DSP Systems

English

Minimising Buffer Requirements of Synchronous Dataflow Graphs With Model Checking

English

Schedule-Extended Synchronous Dataflow Graphs

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Computer Graphics

Computer-Aided Design

Electronic Engineering

English

Efficient Computation of Distance Labeling for Decremental Updates in Large Dynamic Graphs

Computer Networks

English

Buffer Merging Technique for Minimizing Memory Footprints of Synchronous Dataflow Specifications

English

Invariant Inference and Efficient Computation in the Static Factor Model

SSRN Electronic Journal

English

A Model-Based Schedule Representation for Heterogeneous Mapping of Dataflow Graphs

English

Generalized Extraction of Real-Time Parameters for Homogeneous Synchronous Dataflow Graphs

English

Analytic Multi-Loop Results Using Finite Fields and Dataflow Graphs With FiniteFlow

English