Abstract
This work presents a model for communication networks which is more powerful then traditional ones and which may only be realized by using guided optic devices. The authors investigated the power of the model and give algorithms showing that this is an attractive way of implementing extremely fast and easy-to-build parallel computers. The splitting graphs model is characterized by viewing an edge (a communication link between two adjacent processors) as a part of a bus. Each node is able to connect or disconnect any partial set (disjoint of other such sets) of edges. This results in the node and the corresponding neighbors having a common bus consisting of the connected edges.
| Original language | English |
|---|---|
| Pages (from-to) | 93-97 |
| Number of pages | 5 |
| Journal | Proceedings of SPIE - The International Society for Optical Engineering |
| Volume | 1359 |
| State | Published - 1990 |
| Externally published | Yes |
| Event | 1990 International Topical Meeting on Optical Computing - OC '90 - Kobe, Jpn Duration: 8 Apr 1990 → 12 Apr 1990 |
ASJC Scopus subject areas
- Electronic, Optical and Magnetic Materials
- Condensed Matter Physics
- Computer Science Applications
- Applied Mathematics
- Electrical and Electronic Engineering