Name
Abstract | ||
|---|---|---|
Various proposals for networks of large numbers of processors are reviewed. Bottleneck problems arise in these networks with the flow of data between processors. Communication problems which can arise in practical situations are discussed and techniques for reducing bottlenecks are developed. Some simulation results are given for the binary n-cube. |
Year | DOI | Venue |
|---|---|---|
1984 | 10.1016/0020-0190(84)90100-5 | Inf. Process. Lett. |
Keywords | Field | DocType |
communication problem,mimd parallel computer,parallel computer | Bottleneck,Computer science,Parallel computing,Theoretical computer science,MIMD,Binary number | Journal |
Volume | Issue | ISSN |
19 | 2 | 0020-0190 |
Citations | PageRank | References |
2 | 1.31 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| G. P. Mckeown | 1 | 53 | 9.29 |
| V. J. Rayward-Smith | 2 | 266 | 59.21 |