A4 Refereed article in a conference publication
Hot-potato routing algorithms for sparse optical torus
Authors: Honkanen R, Leppänen V, Penttonen M
Editors: T.M. Pinkston
Publication year: 2001
Book title : Proceedings of 30th International Workshops on Parallel Processing (ICPP 2001 Workshops)
Journal name in source: INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING WORKSHOPS, PROCEEDINGS
First page : 302
Last page: 307
Number of pages: 6
ISBN: 0-7695-1260-7
ISSN: 1530-2016
DOI: https://doi.org/10.1109/ICPPW.2001.951966
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.
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.
UTU Research Portal