CTDNet-A Mechanism for Execution of Lambda Graphs the Concurrent
Jai Prakash Gupta, Stephen C. Winter, Derek R. Wilson · 1989
CTDNet is a data-driven reduction machine for the con- current execution of applicative functional programs in the form of lambda calculus expressions. Such programs are stored as binary tree structured process graphs in which all processes maintain pointers to their immediate neighbors (i.e., ancestor and two children). Processes are of two basic types: master processes which represent the original process graph, and slave processes which carry out the actual execu- tional work and are dynamically created and destroyed. CTDNet em- ploys a distributed eager evaluation scheme with a modification to eval- uate conditional expressions lazily, together with a form of distributed string reduction, with some graph-like modifications.