Locality, communication, and interconnect length in multicomputers
SIAM Journal on Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Efficient routing in optical networks
Journal of the ACM (JACM)
Optical networks: a practical perspective
Optical networks: a practical perspective
All-to-all optical routing in optimal chordal rings of degree four
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Analysis of the evolution of peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Scheduling Parallel Communication: The h-relation Problem
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Observations on the Dynamic Evolution of Peer-to-Peer Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
"Balls into Bins" - A Simple and Tight Analysis
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
On the Feasibility of Optical Circuit Switching for High Performance Computing Systems
SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
| Hi-index | 0.00 |
We present an all-optical ring network architecture with logarithmic shortcuts and a systolic routing protocol for it. An r-dimensional optical ring network with logarithmic shortcuts (ORLS) consists of n = 2r nodes and r2r optical links. We study a systolic routing protocol that is based on cyclic changes of the states of routers and scheduled sendings of packets. The protocol ensures that no electro-optical conversions are needed in the intermediate routing nodes and all the packets injected into the routing machinery reach their targets without collisions. A work-optimal routing of an h-relation is achieved with a reasonable size of h ε Ω(n log n).