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 {{cleanup}} and {{lead rewrite}} tags to article using TW). 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)

This article may require cleanup to meet Wikipedia's quality standards. No cleanup reason has been specified. Please help improve this article if you can. (March 2011) (Learn how and when to remove this message)

The article's lead section may need to be rewritten. Please review the lead layout guide and help improve the lead of this article if you can. (March 2011) (Learn how and when to remove this message)

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

External links

This computer science article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Synchronous_Data_Flow&oldid=417934191"

Hidden categories: