Draft:Synchronous Dataflow
| Submission declined on 11 March 2018 by Chenzw (talk). Thank you for your submission, but the subject of this article already exists in Wikipedia. You can find it and improve it at Synchronous Data Flow instead.
Where to get help
How to improve a draft
You can also browse Wikipedia:Featured articles and Wikipedia:Good articles to find examples of Wikipedia's best writing on topics similar to your proposed article. Improving your odds of a speedy review To improve your odds of a faster review, tag your draft with relevant WikiProject tags using the button below. This will let reviewers know a new draft has been submitted in their area of interest. For instance, if you wrote about a female astronomer, you would want to add the Biography, Astronomy, and Women scientists tags. Editor resources
This draft has not been edited in over six months and qualifies to be deleted per CSD G13. Declined by Chenzw 7 years ago. Last edited by Chenzw 7 years ago. Reviewer: Inform author.
|  |
Synchronous Dataflow is a concurrent model of computation in which units of computations are called actors communicating through edges. The model therefore can be represented as a graph in which nodes of the graph are actors. Actors communicate with each other using abstract data called tokens. An actor has production rates on all its outgoing edges and consumption rate on all its incoming edges. When an actor is executed it consumes a number of tokens equal to the rates on all its incoming edges and produces a number of tokens equal to the rates on all its outgoing edges.[1]
References
- ^ Lee, Edward A., and David G. Messerschmitt. "Synchronous data flow." Proceedings of the IEEE 75.9 (1987): 1235-1245.