Home Staff Members

RUFT: Simplifying the fat-tree topology

Research Area: Routing Algorithms Year: 2008
Type of Publication: In Proceedings Keywords: Interconnection networks;Internet;Routing algorithms;Switches;Switching circuits;
Authors:
Book title: Parallel and Distributed Systems, 2008. ICPADS '08. 14th IEEE International Conference on
Pages: 153 - 160
Address: Melbourne, VIC, Australia
ISSN: 1521-9097
Note:
Adaptive routing;Deterministic routing algorithms;Evaluation results;Large networks;Multi-stage interconnection networks;Network costs;Network traffics;Number of switches;Power consumption;Switch sizes;Traffic loads;Traffic patterns;Tree topologies;
Abstract:
The fat-tree is one of the most widely-used topologies by interconnection network manufacturers. Recently, a deterministic routing algorithm that optimally balances the network traffic in fat-trees was proposed. It can not only achieve almost the same performance than adaptive routing, but also outperforms it for some traffic patterns. Nevertheless, fat-trees require a high number of switches with a non-negligible wiring complexity. In this paper, we propose replacing the fat-tree by an unidirectional multistage interconnection network referred to as Reduced Unidirectional Fat-tree (RUFT) that uses a a simplified version of the aforementioned deterministic routing algorithm. As a consequence, switch hardware is almost reduced to the half, decreasing, in this way, power consumption, arbitration complexity, switch size, and network cost. Evaluation results show that RUFT obtains lower latency than fat-tree for low and medium traffic loads. Furthermore, in large networks, it obtains almost the same throughput than the classical fat-tree. {&}copy; 2008 IEEE.
[Bibtex]

Sponsors

Banner
Banner
Banner
Banner
Banner
Banner
Banner