Synchronous Data Flow
 | This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)
|
Synchronous Data Flow (SDF) is a restriction on Kahn process networks where the number of tokens read and written by each process is known ahead of time. In some cases, processes can be schedued such that channels have bounded FIFOs[1].
Limitations
The SDF model does not account for asynchronous processes as their token read/write rates will vary. Practically, one can divide the network into synchronous subnetworks connected by asynchronous links. Alternatively a runtime supervisor can enforce fairness and other desired properties[1].
Applications
SDF is useful for modeling digital signal processing routines. This model can then be compiled to target parallel hardware like FPGAs, DSP instruction sets like Qualcomm's Hexagon, and other systems.
See also
External links
- Synchronous Data Flow, Edward A. Lee and David G. Messerschmitt, 1987
- Embedded Software Systems course - Synchronous Dataflow
- SDF analysis and visualization tools
- Kahn Process Networks and a Reactive Extension
 | This computer science article is a stub. You can help Wikipedia by expanding it. |
- ^ a b Lee, Edward Ashford; Messerschmitt, David G. (1987-01). "Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing". IEEE Transactions on Computers. C-36 (1): 24–35. doi:10.1109/TC.1987.5009446. ISSN 0018-9340.
{{cite journal}}: Check date values in:|date=(help)