Routing problems on the r-dimensional n × n × · · · × n mesh architecture, enhanced with independent buses along each dimension, are investigated. We analyze several different kinds of routing problems, among them off-line routing, and provide routing algorithms for the one-dimensional, two-dimensional, and r-dimensional meshes. Asymptotically, we show that, queuesize being equal, the bus-equipped mesh architecture outperforms the classical mesh by speeding up the routing time by a factor of 12 7.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Hardware and Architecture
- Computer Networks and Communications
- Artificial Intelligence