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 full text

Date
Authors
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

2005English

Schedule-Extended Synchronous Dataflow Graphs

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
ElectricalSoftwareComputer GraphicsComputer-Aided DesignElectronic Engineering
2013English

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

World Wide Web
HardwareComputer NetworksSoftwareArchitectureCommunications
2016English

Buffer Merging Technique for Minimizing Memory Footprints of Synchronous Dataflow Specifications

2015English

Invariant Inference and Efficient Computation in the Static Factor Model

SSRN Electronic Journal
2013English

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

2015English

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

2011English

Low Time Complexity Algorithms for Path Computation in Cayley Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy