Dataflow: Review

Answer these questions to review the webpage on dataflow.

We use dataflow in analyzing several algorithms. We use timelines to discuss performance of a few algorithms. This review emphasizes dataflow.

What is an event?
How is an event related to an execution of a receive statement by an agent?
What are the inputs and outputs of an event?
What are the vertices of a dataflow graph?
What are the edges of a dataflow graph?
How do edges of a dataflow graph of a computation represent the flow of data between steps of the computation?
What is the concept of time in dataflow?
What is the difference between event and step?
What is the relationship between computations and dataflow graphs?
What is a topological sort of a directed acyclic graph?
What is the key theorem relating computations and dataflow graphs?

The next pages describes

Cuts in Dataflow Graphs which are used in developing detection algorithms such as termination detection and deadlock detection.

K. Mani Chandy, Emeritus Simon Ramo Professor, California Institute of Technology