Open Access
An asynchronous programming language and computing machine
Arvind,Kim P. Gostelow,Wil Plouffe +2 more
- 01 Jan 1978
234
TL;DR: Arvind and Gostelow as mentioned in this paper present a high-level dataflow language called Id and its companion base language, which supports programming with streams, programmer-defined data types, and facilities for nondeterministic programming.
read more
Abstract: Author(s): Arvind; Gostelow, Kim P.; Plouffe, Wil | Abstract: Dataflow is presented as an alternative to the von Neumann model as the basis for computer system design. The need for a new semantic basis is supported by current research both in software methodologies and in computer architecture. Dataflow systems emphasize asynchronous and functional computation. We present a high-level dataflow language Id, and its companion base language. Id supports programming with streams, programmer-defined data types, and facilities for nondeterministic programming. The base language when interpreted by the unfolding interpreter generates a potentially large number of independent activites which can be executed concurrently by a dataflow machine. The unfolding interpreter seems very promising for implementation on a machine composed of large numbers of LSI processors.
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
The program dependence graph and its use in optimization
TL;DR: An intermediate program representation, called the program dependence graph (PDG), that makes explicit both the data and control dependences for each operation in a program, allowing transformations to be triggered by one another and applied only to affected dependences.
The program Dependence Graph and its Use in Optimization
Jeanne Ferrante,Karl J. Ottenstein,Joe D. Warren +2 more
- 17 Apr 1984
TL;DR: An intermediate program representation, called a program dependence graph or PDG, which summarizes not only the data dependences of each operation but also summarizes the control dependence of the operations, which allows transformations such as vectorization to be performed in a manner which is uniform for both data and control dependence.
•Book
Readings in Distributed Artificial Intelligence
Alan H. Bond,Les Gasser +1 more
- 05 Jun 2014
TL;DR: This comprehensive collection of articles shows the breadth and depth of DAI research as well as to practical problems in artificial intelligence, distributed computing systems, and human-computer interaction.
1.1K
Dependence graphs and compiler optimizations
David J. Kuck,Robert H. Kuhn,David Padua,Bruce Leasure,Michael Wolfe +4 more
- 26 Jan 1981
TL;DR: This paper defines such graphs and discusses two kinds of transformations, simple rewriting transformations that remove dependence arcs and abstraction transformations that deal more globally with a dependence graph.
752
Executing a program on the MIT tagged-token dataflow architecture
Arvind,Rishiyur S. Nikhil +1 more
TL;DR: An overview of current thinking on dataflow architecture is provided by describing example Id programs, their compilation to dataflow graphs, and their execution on the TTDA, a multiprocessor architecture.
508