Very-high-speed holographic message routing for parallel machines. Final report, 1 Sep 88-31 Aug 90
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 O(n log(n)) 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,
- Research Organization:
- Duke Univ., Durham, NC (USA). Dept. of Computer Sciences
- OSTI ID:
- 5673406
- Report Number(s):
- AD-A-230965/6/XAB; CNN: DAAL03-88-K-0195
- Country of Publication:
- United States
- Language:
- English
Similar Records
Relay approach message routing in hypercube multiprocessors
Predicting scattering of electromagnetic fields using FD-TD on a connection machine
Related Subjects
990200* -- Mathematics & Computers
BENCH-SCALE EXPERIMENTS
COMMUNICATIONS
COMPUTER NETWORKS
CONTROL
ELECTRICAL EQUIPMENT
ELECTRONIC CIRCUITS
EQUIPMENT
HOLOGRAPHY
LEARNING
MISSION ANALYSIS
OPTICAL SYSTEMS
OPTIMIZATION
PARALLEL PROCESSING
PROGRAMMING
ROUTING
SWITCHES
SWITCHING CIRCUITS
VOLUME