Researchers: | Eleftherios D. Matsikoudis |
---|---|

Advisor: | Edward A. Lee |

Dataflow is a model of computation where a collection of actors communicate through unidirectional first-in first-out (FIFO) channels. Each dataflow actor is defined as a set of firing rules and a firing function. Firing rules specify what tokens must be available at the inputs for the actor to fire. The firing function specifies the input tokens consumed and the output tokens produced when the actor fires, and possibly a new set of firing rules along with a new firing function, thus reflecting an update to the state of the actor. Under suitable conditions, these actors define continuous functions, typically referred to as dataflow processes, over the complete partial order (CPO) of all finite and infinite sequences of tokens under the natural prefix order, and therefore provide for an alternative implementation of Kahn process networks [1].

Despite the abundance of dataflow applications in the embedded systems community, dataflow does not qualify as a programming language. Unless an evaluation strategy is specified, it is impossible to provide a semantic interpretation that will unambiguously assign a meaning to a dataflow network. A considerable amount of research has centered around evaluation strategies that will adhere to Kahn’s least fixed-point solution. However, tailoring the operational semantics of a language to fit the simplicity and mathematical convenience of a particular denotational semantics is somewhat questionable. Park’s bounded scheduling policy [2] stands out for promoting bounded execution at the expense of convergence to Kahn’s least fixed-point semantics. Nonetheless, it compromises compositionality and renders dataflow programming and execution intractable to formal reasoning.

This work focuses on a formal operational semantics for a dataflow programming language. The objective is to identify a set of computation rules that can yield bounded execution, whenever possible, and at the same time remain uncoupled from the low-level machine details, and hence more amenable to formal analysis. The notion of compositionality serves as a compass in this process, offering a solid correctness criterion for the proposed formalism. Questions on optimality issues are also to be addressed.

[1] E. A. Lee, “A Denotational Semantics for Dataflow with Firing”, Memorandum UCB/ERL M97/3, Electronics Research Laboratory, U. C. Berkeley, January 1997.

[2] T. M. Parks, “Bounded Scheduling of Process Networks”, Technical Memorandum UCB/ERL-95-105, Ph.D. Thesis, EECS Department, University of California, Berkeley, CA 94720, December 1995.

Last updated 10/17/05