A Semi-Automatic Multiple-Strategy Approach To Mapping Tree-Structured Symbolic Processing Programs.
Symbolic applications such as expert systems, theorem provers, and computer algebra exhibit dynamic, tree-structured behavior with respect to control and data structures. This is why it is difficult to parallelize a program and get it running efficiently on a parallel computer, especially one with d...
| Julkaisussa: | Journal of symbolic computation. 21, 4-6 (1996). |
|---|---|
| Päätekijä: | |
| Aineistotyyppi: | Artikkeli |
| Kieli: | English |