Demand-Driven Interpretation of FP Programs on a Data-Flow Multiprocessor

Authors:
Yi-Hsiu Wei;Jean-Luc Gaudiot
Affiliations:
Univ. of Southern California, Los Angeles;Univ. of Southern California, Los Angeles
Venue:
IEEE Transactions on Computers - Special issue on architectural support for programming languages and operating systems
Year:
1988

Citing 15
Cited 2

The Manchester prototype dataflow computer

Communications of the ACM - Special section on computer architecture
Efficient demand-driven evaluation. Part 1

ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Efficient demand-driven evaluation. Part 2

ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
An Architectural Comparison of Dataflow Systems

Computer
Executing a program on the MIT tagged-token dataflow architecture

Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Dataflow machine architecture

ACM Computing Surveys (CSUR)
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Efficient compilation of lazy evaluation

SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
Introduction to Mathematical Theory of Computation

Introduction to Mathematical Theory of Computation
Reduction languages for reduction machines

ISCA '75 Proceedings of the 2nd annual symposium on Computer architecture
The Algebra of Functional Programs: Function Level Reasoning, Linear Equations, and Extended Definitions

Proceedings of the International Colloquium on Formalization of Programming Concepts
First version of a data flow procedure language

Programming Symposium, Proceedings Colloque sur la Programmation
Super-combinators a new implementation method for applicative languages

LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
A GRAPH MODEL FOR PARALLEL COMPUTATIONS

A GRAPH MODEL FOR PARALLEL COMPUTATIONS
Parallel implementation of a single-assignment language

Parallel implementation of a single-assignment language

PSB graphs for simulating cooperative and distributed program behavior

CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Task allocation in data flow multiprocessors: an annotated bibliography

ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures

Quantified Score

Hi-index	0.00

Visualization

Abstract

Presents a demand-driven evaluation system for list-structure language systems, using the functional language FP. It enables execution in a data-driven environment. A formal approach for transforming FP programs into lazy programs, which contain the notion of demands, is used. The superset language of FP is called DFP (demand-driven FP). A demand reduction scheme is used to remove unnecessary demand propagations on DFP programs to reduce run-time overhead. The DFP programs are translated into data-flow graphs according to the graph schemata developed from the FP-DFP transformation rules. The execution characteristics of the DFP graphs are identified and the architecture supports for efficient execution are suggested. The system allows programming in FP by infinite data structures and the application of partial-function-value evaluation. Examples of these applications are used to demonstrate the transformation process, the principles of run-time interpretation, the effectiveness of the transformation, and the power of the evaluation system.