Name
Abstract | ||
|---|---|---|
Interconnection networks appear in several technological fields of great importance. An efficient design of such a network is crucial because of its impact on system performance. A routing scheme that minimises contention should be included. We have developed a new method to uniformly distribute traffic over the network called Dynamic Routing Balancing (DRB) that it is based on limited and load-controlled path randomisation in ol der to maintain a low message latency and avoid the formation of hot-spots. DRB has two components: Static alternative path definition and dynamic path selection policies. The present the alternative path definition and its implementation for k-ary n-cubes and midimew networks, as well as, its evaluation in terms of latency and bandwidth. Some conclusions and comparisons with existing methods are done. Also, the selection policies are described They are designed with the goals of minimising monitoring and decision overhead. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1109/EMPDP.1998.647187 | PROCEEDINGS OF THE SIXTH EUROMICRO WORKSHOP ON PARALLEL AND DISTRIBUTED PROCESSING - PDP '98 |
Keywords | DocType | Citations |
computer networks,routing,hot spot,parallel computer,resource allocation,system performance,bandwidth,concurrent computing,asynchronous transfer mode,dynamic routing | Conference | 3 |
PageRank | References | Authors |
0.46 | 9 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| I. Garcés | 1 | 22 | 5.80 |
| Daniel Franco | 2 | 5 | 1.61 |
| Emilio Luque | 3 | 1097 | 176.18 |