Demand-Driven Dataflow for Concurrent Committed-Choice Code

Concurrent logic languages have been traditionally executed in a "greedy" fashion, such that computations are goal-driven. In contrast, non-strict functional programs have been traditionally executed in a "dataflow" fashion, such that computations are demand-driven. The latter method can be superior when allocation of resources such as memory is critical, which is usually the case for large, complex, and/or reactive programs. Specifically, demand-driven execution results in more efficient scheduling and improved termination properties. This paper describes a novel technique for demanddriven execution of concurrent logic language programs. This paper was submitted to International Conference on Parallel Architectures and Compilation Techniques, Montreal, August 1994. Department of Computer and Information Science University of Oregon Contents 1 Introduction 1 2 Demand-Driven Evaluation 3 3 Implementation Model 6 3.1 Objects Required by the Model : : : : : : : : : : : : : : : : : : ..