Static scheduling of synchronous data flow programs for digital signal processing
IEEE Transactions on Computers
Consistency in Dataflow Graphs
IEEE Transactions on Parallel and Distributed Systems
Converting graphical DSP programs into memory constrained software prototypes
RSP '95 Proceedings of the Sixth IEEE International Workshop on Rapid System Prototyping (RSP'95)
Hardware-software codesign with GRAPE
RSP '95 Proceedings of the Sixth IEEE International Workshop on Rapid System Prototyping (RSP'95)
IEEE Transactions on Signal Processing
Memory efficient software synthesis form dataflow graph
Proceedings of the 11th international symposium on System synthesis
Data Routing in Dataflow Graphs
RSP '97 Proceedings of the 8th International Workshop on Rapid System Prototyping (RSP '97) Shortening the Path from Specification to Prototype
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Hi-index | 0.00 |
The paper presents an algorithm to determine the smallest possible data buffer sizes for arbitrary synchronous data flow (SDF) applications, such that we can guarantee the existence of a deadlock free schedule. The presented algorithm fits in the design flow of GRAPE, an environment for the emulation and implementation of digital signal processing (DSP) systems on arbitrary target architectures, consisting of programmable DSP processors and FPGAs. Reducing the size of data buffers is of high importance when the application will be mapped on Field Programmable Gate Arrays (FPGA), since register resources are rather scarce.