Locality, communication, and interconnect length in multicomputers
SIAM Journal on Computing
General purpose parallel architectures
Handbook of theoretical computer science (vol. A)
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
Work-Optimal Routing in Wavelength-Division Multiplexed Dense Optical Tori
CSE '08 Proceedings of the 2008 11th IEEE International Conference on Computational Science and Engineering
Work-optimal two-phase routing in a sparse optical torus
Proceedings of the 13th International Conference on Computer Systems and 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 |
In this paper, we present an all-optical network architecture and an all-optical router for it. The dense 3-dimensional optical torus network (WDOT) consists of an n x n x n torus, each node having a processor. The number of processors of the network is P = n3 and the number of optical links is L = 3n3. 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-relations is achieved with a reasonable size of h ∈ Θ(P log P).