Amanote Research
Register
Sign In
Minimising Buffer Requirements of Synchronous Dataflow Graphs With Model Checking
doi 10.1109/dac.2005.193928
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2005
Authors
M. Geilen
T. Basten
S. Stuijk
Publisher
IEEE
Related search
Schedule-Extended Synchronous Dataflow Graphs
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Electrical
Software
Computer Graphics
Computer-Aided Design
Electronic Engineering
Efficient Computation of Buffer Capacities for Cyclo-Static Dataflow Graphs
Proceedings - Design Automation Conference
Control
Systems Engineering
Electronic Engineering
Simulation
Hardware
Computer Science Applications
Electrical
Architecture
Modeling
Buffer Merging Technique for Minimizing Memory Footprints of Synchronous Dataflow Specifications
Generalized Extraction of Real-Time Parameters for Homogeneous Synchronous Dataflow Graphs
A Model-Based Schedule Representation for Heterogeneous Mapping of Dataflow Graphs
State-Based Model Checking of Event-Driven System Requirements
IEEE Transactions on Software Engineering
Software
Analytic Multi-Loop Results Using Finite Fields and Dataflow Graphs With FiniteFlow
Quasi-Static Scheduling of Reconfigurable Dataflow Graphs for DSP Systems
Scheduling and Buffer Sizing of N-Synchronous Systems
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
