SDF3 is a C++ library that implements a large collection of algorithms for timed dataflow graphs, including Scenario-Aware Dataflow, max-plus algebra, including switching max-plus-linear systems, and multiprocessor mapping. For example, throughput analysis [1][2], latency analysis [3], buffer sizing [4][5][6], parametric analysis [7][8], and many more.
An somewhat older version of SDF3 is GPL Licensed and available on https://www.es.ele.tue.nl/sdf3/ We plan to make a more recent version available on GitHub.
References
- (2006): Throughput Analysis of Synchronous Data Flow Graphs. In: Sixth International Conference on Application of Concurrency to System Design (ACSD'06), pp. 25-36, 2006.
- (2010): Worst-Case Performance Analysis of Synchronous Dataflow Scenarios. In: Proceedings of the Eighth IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis, pp. 125โ134, Association for Computing Machinery, Scottsdale, Arizona, USA, 2010, ISBN: 9781605589053.
- (2008): Resource-efficient routing and scheduling of time-constrained streaming communication on networks-on-chip. In: Journal of Systems Architecture, vol. 54, no. 3, pp. 411-426, 2008, ISSN: 1383-7621, (System and Network on Chip).
- (2005): Minimising Buffer Requirements of Synchronous Dataflow Graphs with Model Checking. In: Proceedings of the 42nd Annual Design Automation Conference, pp. 819โ824, Association for Computing Machinery, Anaheim, California, USA, 2005, ISBN: 1595930582.
- (2006): Exploring Trade-Offs in Buffer Requirements and Throughput Constraints for Synchronous Dataflow Graphs. In: Proceedings of the 43rd Annual Design Automation Conference, pp. 899โ904, Association for Computing Machinery, San Francisco, CA, USA, 2006, ISBN: 1595933816.
- (2019): Monotonic optimization of dataflow buffer sizes. In: Journal of signal processing systems, vol. 91, pp. 21โ32, 2019.
- (2008): Parametric Throughput Analysis of Synchronous Data Flow Graphs. In: 2008 Design, Automation and Test in Europe, pp. 116-121, 2008, ISSN: 1530-1591.
- (2012): Parametric throughput analysis of scenario-aware dataflow graphs. In: 2012 IEEE 30th International Conference on Computer Design (ICCD), pp. 219-226, 2012, ISSN: 1063-6404.
Selected Related Publications
2012
Parametric throughput analysis of scenario-aware dataflow graphs Proceedings Article
In: 2012 IEEE 30th International Conference on Computer Design (ICCD), pp. 219-226, 2012, ISSN: 1063-6404.
Modeling static-order schedules in synchronous dataflow graphs Proceedings Article
In: Design, Automation Test in Europe Conference Exhibition (DATE), 2012, pp. 775-780, 2012, ISSN: 1530-1591.
Predictable dynamic embedded data processing Proceedings Article
In: 2012 International Conference on Embedded Computer Systems (SAMOS), pp. 320-327, 2012.
2011
Scenario-aware dataflow: Modeling, analysis and implementation of dynamic applications Proceedings Article
In: 2011 International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation, pp. 404-411, 2011.
2010
A Predictable Multiprocessor Design Flow for Streaming Applications with Dynamic Behaviour Proceedings Article
In: 2010 13th Euromicro Conference on Digital System Design: Architectures, Methods and Tools, pp. 548-555, 2010.
Worst-Case Performance Analysis of Synchronous Dataflow Scenarios Proceedings Article
In: Proceedings of the Eighth IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis, pp. 125โ134, Association for Computing Machinery, Scottsdale, Arizona, USA, 2010, ISBN: 9781605589053.
2008
Parametric Throughput Analysis of Synchronous Data Flow Graphs Proceedings Article
In: 2008 Design, Automation and Test in Europe, pp. 116-121, 2008, ISSN: 1530-1591.
Resource-efficient routing and scheduling of time-constrained streaming communication on networks-on-chip Journal Article
In: Journal of Systems Architecture, vol. 54, no. 3, pp. 411-426, 2008, ISSN: 1383-7621, (System and Network on Chip).
Throughput-Buffering Trade-Off Exploration for Cyclo-Static and Synchronous Dataflow Graphs Journal Article
In: IEEE Trans. Comput., vol. 57, no. 10, pp. 1331โ1345, 2008, ISSN: 0018-9340.
2007
Predictable mapping of streaming applications on multiprocessors PhD Thesis
Electrical Engineering, 2007, ISBN: 978-90-386-1624-7, (Proefschrift.).
Multiprocessor Resource Allocation for Throughput-constrained Synchronous Dataflow Graphs Proceedings Article
In: Proceedings of the 44th Annual Design Automation Conference, pp. 777โ782, ACM, San Diego, California, 2007, ISBN: 978-1-59593-627-1.
2006
Throughput Analysis of Synchronous Data Flow Graphs Proceedings Article
In: Sixth International Conference on Application of Concurrency to System Design (ACSD'06), pp. 25-36, 2006.
Exploring Trade-Offs in Buffer Requirements and Throughput Constraints for Synchronous Dataflow Graphs Proceedings Article
In: Proceedings of the 43rd Annual Design Automation Conference, pp. 899โ904, Association for Computing Machinery, San Francisco, CA, USA, 2006, ISBN: 1595933816.
Resource-Efficient Routing and Scheduling of Time-Constrained Network-on-Chip Communication Proceedings Article
In: 9th EUROMICRO Conference on Digital System Design (DSD'06), pp. 45-52, 2006.