Abstract
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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 187-197 |
| Number of pages | 11 |
| Journal | Journal of Parallel and Distributed Computing |
| Volume | 20 |
| Issue number | 2 |
| DOIs | |
| State | Published - Feb 1994 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computer Networks and Communications
- Artificial Intelligence