Name
Abstract | ||
|---|---|---|
A new topology for interconnection networks has been proposed. The underlying network graph has N = 4 n nodes ( n ≥ 2) and is almost regular with maximum degree 5 and diameter ≤ ⌊3/4 log 2 N ⌋ + 1. Algorithms for point-to-point routing and single node broadcast have also been developed. It has also been shown that various algorithms for real life applications, e.g., matrix transpose, matrix multiplication, finding the sum/average/maximum/minimum of a set of data elements and ASCEND/DESCEND types of algorithms can be efficiently implemented on this topology. Finally, the underlying idea of constructing this network has been generalized to define a family of almost regular odd degree graphs of maximum degree 2 j + 1, ( j > 2) with N = (2 j ) n nodes and diameter ⌊3/4 log j N ⌋ + 1. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1006/jpdc.1996.0157 | J. Parallel Distrib. Comput. |
Keywords | Field | DocType |
new topology,multiprocessor system,odd degree,matrix multiplication,maximum degree,point to point | Computer science,Degree (graph theory),Distributed computing,Broadcasting,Topology,Discrete mathematics,Graph,Combinatorics,Matrix calculus,Transpose,Parallel computing,Multiprocessing,Interconnection,Matrix multiplication | Journal |
Volume | Issue | ISSN |
39 | 1 | Journal of Parallel and Distributed Computing |
Citations | PageRank | References |
1 | 0.36 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rajib K. Das | 1 | 35 | 8.94 |
| Bhabani P. Sinha | 2 | 464 | 55.72 |