An efficient strategy for reducing head-of-line blocking in fat-trees

  • Authors:
  • Jesus Escudero-Sahuquillo;Pedro Javier Garcia;Francisco J. Quiles;Jose Duato

  • Affiliations:
  • Dept. of Computing Systems, University of Castilla-La Mancha, Spain;Dept. of Computing Systems, University of Castilla-La Mancha, Spain;Dept. of Computing Systems, University of Castilla-La Mancha, Spain;Dept. of Computer Engineering, Technical University of Valencia, Spain

  • Venue:
  • Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

The fat-tree is one of the most common topologies for the interconnection networks of PC Clusters which are currently used for high-performance parallel computing. Among other advantages, fat-trees allow the use of simple but very efficient routing schemes. One of them is a deterministic routing algorithm that has been recently proposed, offering similar (or better) performance than Adaptive Routing while reducing complexity and guaranteeing in-order packet delivery. However, as other deterministic routing proposals, this deterministic routing algorithm cannot react when high traffic loads or hot-spot traffic scenarios produce severe contention for the use of network resources, leading to the appearance of Head-Of-Line (HOL) blocking, which spoils network performance. In that sense, we present in this paper a simple, efficient strategy for dealing with the HOL blocking that may appear in fat-trees with the aforementioned deterministic routing algorithm. From the results presented in the paper, we can conclude that, in the mentioned environment, our proposal considerably reduces HOL blocking without significantly increasing switch complexity and required silicon area.