Very High Speed Holographic Message Routing for Parallel Machines
Final rept. 1 Sep 1988-31 Aug 1990
DUKE UNIV DURHAM NC DEPT OF COMPUTER SCIENCE
Pagination or Media Count:
An important problem in massively parallel processing machines is the communication bottleneck. For example, in the Connection Machine, a 65,536 SIMD parallel processing message routing is one thousand times slower than the instruction time of an individual processor. This is, in part, due to contention problems and in part to the necessity for global control of the interconnection network. Our approach to solve this problem is to implement a fully-parallel, high-speed message router, using locally-controlled spatial light modulators and volume holograms. Johnson and Reif devised an efficient electro-optical message routing system. We implemented a small prototype holographic router for demonstration of basic principals. The routing system uses a volume hologram to do message switching. It uses optimal On logn number of switches, constant time, and optimal volume. This work can be applied to do very high speed message routing for massively parallel machines such as required by the Connection Machine.
- Computer Systems