Abstract
Recall that in a dataflow graph, the data values on the edges are referred to as tokens. Formally, an SDF graph is a directed multigraph in which each edge α has three properties in addition to src(α) and snk(α):
-
del(α), a nonnegative integer that gives the number of initial tokens associated with α. The number of initial tokens del (α) is also called the delay of an edge because it can induce an offset in the execution of the sink actor in relation to the source actor.
-
prd(α), a positive integer that indicates the number of tokens produced onto the channel corresponding to α by each execution of the computation corresponding to src(α).
-
cns (α), a positive integer that represents the number of tokens consumed from α by each execution of snk(α).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Battacharyya, S.S., Murthy, P.K., Lee, E.A. (1996). Synchronous dataflow. In: Software Synthesis from Dataflow Graphs. The Kluwer International Series in Engineering and Computer Science, vol 360. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1389-2_3
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1389-2_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8601-1
Online ISBN: 978-1-4613-1389-2
eBook Packages: Springer Book Archive