The connection machine
Transputer-based experiments with the ZAPP architecture
Volume I: Parallel architectures on PARLE: Parallel Architectures and Languages Europe
Fundamentals of Computer Alori
Fundamentals of Computer Alori
Syntax and informal semantics of DyNe, a parallel language
The Analysis of Concurrent Systems
Executing functional programs on a virtual tree of processors
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Occam Programming Manual
What have we learnt from using real parallel machines to solve real problems?
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
| Hi-index | 0.00 |
In [9] we describe a simple virtual tree architecture intended to exploit parallelism in recursive algorithms. The architecture, called ZAPP (Zero Assignment Parallel Processor), is relatively simple to implement using transputers. Early experiments with small configurations were encouraging both with respect to relative speedups and, somewhat to our surprise as ZAPP was simulated, absolute performance.In this paper we report more recent experiments with matrix multiplication and heuristic search applications on configurations involving between 12 and 32 transputers. The results support the conjecture that real speedups are obtainable from transputers using simple ZAPP-like diffusion techniques.