Abstract
Communication between processors is one of the most important issues in parallel and distributed systems. In this paper we study the communication aspects of a well known multiprocessor structure, the Cube-Connected Cycles (CCC). Only nonoptimal routing algorithms and bounds on the diameter of restricted subclasses of the CCC have been presented in earlier work. In this paper, we present an optimal routing algorithm for the general CCC, with a formal proof of its optimality. Based on this routing algorithm, we derive the exact network diameter for the general CCC.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1172-1178 |
| Number of pages | 7 |
| Journal | IEEE Transactions on Parallel and Distributed Systems |
| Volume | 4 |
| Issue number | 10 |
| DOIs | |
| State | Published - Oct 1993 |
Keywords
- Cube-connected cycles
- diameter
- hypercube
- multiprocessor
- routing
ASJC Scopus subject areas
- Signal Processing
- Hardware and Architecture
- Computational Theory and Mathematics