Name
Abstract | ||
|---|---|---|
In this paper, we consider a highly recursive interconnection network known as the fully connected cubic network (FCCN). By exploiting its recursive properties, we thoroughly analyze the performance of a simple routing algorithm for the FCCN. We show that at least 80% of the routes obtained from this simple algorithm are shortest paths, and this percentage increases further with the network size. Subsequently, we obtain the network diameter and average internodal distance, taking into account the communication locality that is exhibited in many parallel computations. The presence of the communication locality significantly reduces the average internodal distance. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1006/jpdc.2001.1729 | J. Parallel Distrib. Comput. |
Keywords | Field | DocType |
recursive topologies,cubic networks,recursive interconnection network,interconnection networks,communication locality,shortest-path routing algorithms,routing property,cubic networks.,parallel computer,shortest path | Locality,Recursion (computer science),Shortest path problem,Parallel algorithm,Computer science,Algorithm,SIMPLE algorithm,Interconnection,Recursion,Computation,Distributed computing | Journal |
Volume | Issue | ISSN |
61 | 6 | Journal of Parallel and Distributed Computing |
Citations | PageRank | References |
2 | 0.37 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rocky K. C. Chang | 1 | 659 | 51.06 |
| Hong Y. Wang | 2 | 2 | 0.37 |