Efficient demand-driven evaluation. Part 2

Authors:
Keshav Pingali; Arvind
Affiliations:
Massachusetts Institute of Technology, Cambridge;Massachusetts Institute of Technology, Cambridge
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Year:
1986

Citing 2
Cited 4

Efficient demand-driven evaluation. Part 1

ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
An Extensional Treatment of Dataflow Deadlock

Proceedings of the International Sympoisum on Semantics of Concurrent Computation

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

IEEE Transactions on Computers - Special issue on architectural support for programming languages and operating systems
Architectural support for the efficient data-driven evaluation scheme

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Sparse functional stores for imperative programs

IR '95 Papers from the 1995 ACM SIGPLAN workshop on Intermediate representations
First-class synchronization barriers

Proceedings of the first ACM SIGPLAN international conference on Functional programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In Part 1 of this paper [5], we presented a scheme whereby a compiler could propagate demands through programs in a powerful stream language L. A data-driven evaluation of the transformed program performed exactly the same computation as a demand-driven evaluation of the original program. In this paper we explore a different transformation, which trades the complexity of demand propagation for a bounded amount of extra computation on some data lines.