Jump to content

Synchronous Data Flow

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Radu124 (talk | contribs) at 10:31, 18 February 2011 (Created page with '{{Comp-sci-stub}} A restriction of Kahn process networks, nodes produce and consume a fixed number of data items per firing. Allows static scheduling. See al...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

A restriction of Kahn process networks, nodes produce and consume a fixed number of data items per firing.

Allows static scheduling.

See also Dataflow architecture

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