Open Access
System oriented extensions to dataflow
Steve Paul Landry
- 01 Jan 1981
9
TL;DR: This dissertation addresses the extension of traditional dataflow modeling to include specifications to allow additional control over the execution environment and developed the dataflow simulator, DFSS, which is a highly generalized facility for realizing the execution, debugging, and metering of dataflow programs.
read more
Abstract: This dissertation addresses the extension of traditional dataflow modeling to include specifications to allow additional control over the execution environment. Three major studies are presented: (1) a comparative analysis of several proposed and existing dataflow models and architectures, (2) the specification of several extensions for generalizing traditional abstract dataflow models and providing the opportunity to express greater parallelism, and (3) the design and implementation of an evolutionary test bed for realizing the simulation of dataflow programs and systems.
The extensions to the abstract dataflow model include: (1) a generalized firing rule to eliminate unnecessary synchronization introduced by requiring all inputs to be available before enabling nodal execution, (2) a mechanism for obtaining a higher degree of parallelism through replication of nodes, (3) a concept of generalized termination detection and signaling useful in supporting replication and streaming, and (4) the description of methods for supporting shared data objects and interprocess communications in a multiple process dataflow environment.
The dataflow simulator, DFSS, was developed in support of this work and is a highly generalized facility for realizing the execution, debugging, and metering of dataflow programs.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A hybrid approach for efficient dataflow computing
Y.-C. Hong,T.H. Payne +1 more
- 21 Mar 1990
TL;DR: A hybrid graph model for data-flow computation that integrates the concepts of 'tagged-token' graphs with those of 'static' graphs is presented, based on partitioning the tagged-token graph into highly connected pieces that become a basic unit for activation and execution.
21
Fine-grain visualization algorithms in dataflow environments
Deyang Song,Eric J. Golin +1 more
- 25 Oct 1993
TL;DR: This paper proposes a fine-grain dataflow model that takes advantage of data locality properties of many visualization algorithms, and shows faster speed, reduced memory usage, and improved CPU utilization over a typical coarse-grain system.
20
EPILOG = PROLOG + Data Flow: arguments for combining PROLOG with a data driven mechanism
TL;DR: The thesis of this work is the seeds of a solution for the difficulties found in data-flow, a revision and substantial expansion of sections 2 and 3 of Wise 82.
8
Fine-grain dataflow model and algorithms for visualization systems
Deyang Song
- 01 Jan 1994
TL;DR: A fine-grain visualization system that exhibits faster speed, less memory usage, and higher CPU utilization than a typical coarse-grain system, and is more memory efficient than previous systems.
6
An object-oriented design for a dataflow simulator
David D. Langan
- 08 Apr 1992
TL;DR: This paper presents an object-oriented design for a dataflow simulator that provides a tool to investigate dataflow models and algorithms.
2
Related Papers (5)
Hugo A. Andrade,Scott Kovner +1 more
- 01 Jan 1998
Łukasz Domagała,Duco van Amstel,Fabrice Rastello +2 more
- 13 Jun 2016
Sebastian Ertel,Christof Fetzer,Pascal Felber +2 more
- 08 Sep 2015