Handbook of Theoretical Computer Science
Handbook of Theoretical Computer Science
Scheduling Parallel Communication: The h-relation Problem
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Solving Fundamental Problems on Sparse-Meshes
SWAT '98 Proceedings of the 6th Scandinavian Workshop on Algorithm Theory
"Balls into Bins" - A Simple and Tight Analysis
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Parallelism in random access machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Hot-Potato Routing Algorithms for Sparse Optical Torus
ICPPW '01 Proceedings of the 2001 International Conference on Parallel Processing Workshops
Nearly-All-Optical Routing in Sparse Optical Tori
PARELEC '06 Proceedings of the international symposium on Parallel Computing in Electrical Engineering
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
| Hi-index | 0.00 |
In this paper we present an all-optical network architecture and a two-phase routing protocol for it. The layered sparse optical torus (LSOT) of degree d consists of n x n nodes at the layer 1, where n = d2. Processors are deployed diagonally at each ith diagonal. The overall number of processors is then P = d3. Additionally a LSOT consists of d2 d x d subnetworks at the layer 2. Routing is based on the scheduled transmission of packets and wavelength-division multiplexing. The routing protocol ensures that no electro-optical conversion is needed at the intermediate nodes and all the packets injected into the routing machinery reach their targets without collisions. A work optimal routing of h-relation is achieved with the size of h ε θ(P).