Jump to content

Synchronous Data Flow

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by WikiWikiWonderful (talk | contribs) at 14:51, 8 December 2020. 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 has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)

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)

This article is an orphan, as no other articles link to it. Please introduce links to this page from related articles; try the Find link tool for suggestions. (March 2018)

(Learn how and when to remove this message)

Synchronous Dataflow is a restriction of Kahn process networks, where nodes produce and consume a fixed number of data items per firing. This allows static scheduling.

It is used in computing and communications, to optimise data transfer traffic management.

It is different from the asynchronous flow of data, which follows a different structure.

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=993048333"

Hidden categories: