Locality, communication, and interconnect length in multicomputers
SIAM Journal on Computing
General purpose parallel architectures
Handbook of theoretical computer science (vol. A)
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Shift Register Sequences
Scheduling Parallel Communication: The h-relation Problem
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
"Balls into Bins" - A Simple and Tight Analysis
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Hot-Potato Routing Algorithms for Sparse Optical Torus
ICPPW '01 Proceedings of the 2001 International Conference on Parallel Processing Workshops
| Hi-index | 0.00 |
In this paper we present an all-optical network architecture and a systolic routing protocol for it. An r-dimensional optical fat tree network ( $\mathcal{OFT}$) consists of 2r–1 routing nodes and n = 2r processing nodes deployed at the leaf nodes of the network. In our construction packets injected into the $\mathcal{OFT}$ carry no routing information. Routing is based on the use of a cyclic control bit sequence and scheduling. The systolic routing protocol ensures that no electro-optical conversion is needed in the intermediate routing nodes and all the packets injected into the routing machinery will reach their target without collisions. A work-optimal routing of an h-relation is achieved with a reasonable size of h.