Jump to content

Synchronous Data Flow

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Shire Reeve (talk | contribs) at 10:08, 9 March 2011 (added Category:Computer architecture; removed {{uncategorized}} using HotCat). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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