Issue No. 11 - November (1989 vol. 15)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.41329
<p>The authors describe CTDNet, a data-driven reduction machine for the concurrent 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 executional work and are dynamically created and destroyed. CTDNet uses a distributed eager evaluation scheme with a modification to evaluate conditional expressions lazily, together with a form of distributed string reduction with some graphlike modifications.</p>
CTDNet; concurrent execution; lambda graphs; data-driven reduction machine; applicative functional programs; lambda calculus expressions; binary-tree-structured process graphs; pointers; neighbors; ancestor; children; master processes; slave processes; distributed eager evaluation scheme; conditional expressions; distributed string reduction; graph theory; parallel machines; parallel programmingas
D. Wilson, S. Winter and J. Gupta, "CTDNet-A Mechanism for the Concurrent Execution of Lambda Graphs," in IEEE Transactions on Software Engineering, vol. 15, no. , pp. 1357-1367, 1989.