Abstract
A parallel implementation of rewriting and narrowing is described. The implementation is written in Flat Concurrent Prolog (FCP) but may be coded in any system in which processes are capable of creating other processes and communicating with each other. The Tower of Hanoi problem, parallel merging, and evaluating algebraic expressions are treated as examples of rewriting. Running programs under the interpreter and using facilities provided by the FCP system has provided empirical evidence of parallel speedup in support of theoretical predictions.
| Original language | English |
|---|---|
| Pages | 426-435 |
| Number of pages | 10 |
| State | Published - Oct 1990 |
| Externally published | Yes |
| Event | Proceedings of the 5th Jerusalem Conference on Information Technology - Jerusalem, Isr Duration: 22 Oct 1990 → 25 Oct 1990 |
Conference
| Conference | Proceedings of the 5th Jerusalem Conference on Information Technology |
|---|---|
| City | Jerusalem, Isr |
| Period | 22/10/90 → 25/10/90 |