Gupta, Jai Prakash and Winter, Stephen and Wilson, Derek R. (1989) CTDNet - A mechanism for the concurrent execution of lambda graphs. IEEE Transactions on Software Engineering, 15 (11). pp. 1357-1367. ISSN 0098-5589Full text not available from this repository.
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.
|Subjects:||University of Westminster > Science and Technology > Electronics and Computer Science, School of (No longer in use)|
|Depositing User:||Miss Nina Watts|
|Date Deposited:||20 Sep 2011 13:46|
|Last Modified:||20 Sep 2011 13:46|
Actions (login required)
|Edit Item (Repository staff only)|