Name
Abstract | ||
|---|---|---|
The fat-tree is one of the most widely-used topologies by interconnection network manufacturers. Recently, it has been demonstrated that a deterministic routing algorithm that optimally balances the network traffic can not only achieve almost the same performance than an adaptive routing algorithm but also outperforms it. On the other hand, fat-trees require a high number of switches with a non-negligible wiring complexity. In this paper, we propose replacing the fat--tree by a unidirectional multistage interconnection network (UMIN) that uses a traffic balancing deterministic routing algorithm. As a consequence, switch hardware is almost reduced to the half, decreasing, in this way, the power consumption, the arbitration complexity, the switch size itself, and the network cost. Preliminary evaluation results show that the UMIN with the load balancing scheme obtains lower latency than fat--tree for low and medium traffic loads. Furthermore, in networks with a high number of stages or with high radix switches, it obtains the same, or even higher, throughput than fat-tree. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/L-CA.2008.8 | Computer Architecture Letters |
Keywords | Field | DocType |
hardware,adaptive routing,cost efficiency,manufacturing,routing,switches,network topology,computational complexity,load balance | Deterministic routing,Load balancing (computing),Computer science,Computer network,Network topology,Multistage interconnection networks,Real-time computing,Throughput,Fat tree,Interconnection,Distributed computing,Computational complexity theory | Journal |
Volume | Issue | ISSN |
7 | 2 | 1556-6056 |
Citations | PageRank | References |
4 | 0.60 | 10 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Crispin Gomez Requena | 1 | 36 | 3.19 |
| Francisco Gilabert Villamón | 2 | 17 | 1.84 |
| María Engracia Gómez | 3 | 149 | 17.48 |
| Pedro Lopez | 4 | 387 | 27.39 |
| José Duato | 5 | 3481 | 294.85 |