RUFT: Simplifying the Fat-Tree Topology

@article{Requena2008RUFTST,
  title={RUFT: Simplifying the Fat-Tree Topology},
  author={Crisp{\'i}n G{\'o}mez Requena and Francisco Gilabert Villam{\'o}n and Mar{\'i}a Engracia G{\'o}mez and Pedro L{\'o}pez and Jos{\'e} Duato},
  journal={2008 14th IEEE International Conference on Parallel and Distributed Systems},
  year={2008},
  pages={153-160}
}
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… CONTINUE READING
Highly Cited
This paper has 25 citations. REVIEW CITATIONS
18 Extracted Citations
12 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 18 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 12 references

On the Influence of the Selection Function on the Performance of Fat-trees

  • F. Gilabert
  • Proc. European Conf. on Parallel Computing,
  • 2006
Highly Influential
5 Excerpts

Design Tradeoffs for Tiled CMP On-chip Networks

  • J. Balfour, W. J. Dally
  • Proc. Annual Int. Conf. on Supercomputing,
  • 2006
2 Excerpts

Similar Papers

Loading similar papers…