Results 1 
4 of
4
A Denotational Semantics for Dataflow with Firing
 Memorandum UCB/ERL M97/ 3, Electronics Research
, 1997
"... Dataflow models of computation have intrigued computer scientists since the 1970s. They were first introduced by Jack Dennis as a basis for parallel programming languages and architectures, and by Gilles Kahn as a model of concurrency. Interest in these models of computation has been recently rekind ..."
Abstract

Cited by 30 (7 self)
 Add to MetaCart
(Show Context)
Dataflow models of computation have intrigued computer scientists since the 1970s. They were first introduced by Jack Dennis as a basis for parallel programming languages and architectures, and by Gilles Kahn as a model of concurrency. Interest in these models of computation has been recently rekindled by the resurrection of parallel computing, due to the emergence of multicore architectures. However, Dennis and Kahn approached dataflow very differently. Dennis ’ approach was based on an operational notion of atomic firings driven by certain firing rules. Kahn’s approach was based on a denotational notion of processes as continuous functions on infinite streams. This paper bridges the gap between these two points of view, showing that sequences of firings define a continuous Kahn process as the least fixed point of an appropriately constructed functional. The Dennis firing rules are sets of finite prefixes satisfying certain conditions that ensure determinacy. These conditions result in firing rules that are strictly more general than the blocking reads of the KahnMacQueen implementation of Kahn process networks, and solve some compositionality problems in the dataflow model. 1
Compositionality in synchronous data flow: Modular code generation from hierarchical sdf graphs
, 2010
"... Hierarchical SDF models are not compositional: a composite SDF actor cannot be represented as an atomic SDF actor without loss of information that can lead to rate inconsistency or deadlock. Motivated by the need for incremental and modular code generation from hierarchical SDF models, we introduce ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
(Show Context)
Hierarchical SDF models are not compositional: a composite SDF actor cannot be represented as an atomic SDF actor without loss of information that can lead to rate inconsistency or deadlock. Motivated by the need for incremental and modular code generation from hierarchical SDF models, we introduce in this paper DSSF profiles. DSSF (Deterministic SDF with Shared FIFOs) forms a compositional abstraction of composite actors that can be used for modular compilation. We provide algorithms for automatic synthesis of nonmonolithic DSSF profiles of composite actors given DSSF profiles of their subactors. We show how different tradeoffs can be explored when synthesizing such profiles, in terms of modularity (keeping the size of the generated DSSF profile small) versus reusability (maintaining necessary information to preserve rate consistency and deadlockabsence) as well as algorithmic complexity. We show that our method guarantees maximal reusability and report on a prototype implementation. 1
Fibrational Semantics of Dataflow Networks
 In Proceedings of CONCUR ’98, LNCS
, 1998
"... . Beginning with the category Dom of Scott domains and continuous maps, we introduce a syntax for dataflow networks as "systems of inequalities," and provide an associated operational semantics. We observe that, under this semantics, a system of inequalities determines a twosided fibr ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. Beginning with the category Dom of Scott domains and continuous maps, we introduce a syntax for dataflow networks as "systems of inequalities," and provide an associated operational semantics. We observe that, under this semantics, a system of inequalities determines a twosided fibration in Dom. This leads to the introduction of a certain class of cartesian arrows of spans as a notion of morphism for systems. The resulting structure Sys, consisting of domains, systems, and morphisms, forms a bicategory that embeds Dom up to equivalence and is suitable as a semantic model for nondeterministic networks. Isomorphism in Sys amounts to a notion of system equivalence "up to deterministic internal computations." 1 Introduction Since the seminal paper of Kahn [Kah74], it has been known that networks of concurrently and asynchronously executing deterministic processes, communicating with each other by sending data values over unbounded FIFO communication channels, admit a simple ...
permission. Compositionality in Synchronous Data Flow: Modular Code Generation from Hierarchical SDF Graphs ∗
, 2009
"... All rights reserved. ..."
(Show Context)