Recurrence equation as basis for designing hot-potato routing protocols
CompSysTech '04 Proceedings of the 5th international conference on Computer systems and technologies
Work-optimal routing in wavelength-division multiplexed three-dimensional dense optical tori
Proceedings of the 11th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing on International Conference on Computer Systems and Technologies
Systolic routing in an optical fat tree
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Systolic routing in an optical butterfly
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
Work-optimal two-phase routing in a sparse optical torus
Proceedings of the 13th International Conference on Computer Systems and Technologies
Address-free all-to-all routing in sparse torus
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
Routing in Coloured Sparse Optical Tori by Using Balanced WDM and Network Sparseness
International Journal of Distributed Systems and Technologies
| Hi-index | 0.00 |
Abstract: In this work we present an optical network architecture and deflection (or hot potato) routing algorithms supporting efficient communication between n processor nodes in a shared memory parallel computer. The sparse optical torus network consists of an n x n torus, where processor nodes are situated diagonally, and routing nodes are optical deflection nodes of two inputs and two outputs. A design of optical deflection node is presented. Several routing algorithms, based on the greedy routing algorithm, are developed. By experiments and partial theoretical analyses these algorithms run efficiently on sparse optical torus.