RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication
Artículo científico (JournalArticle)
Cost-effective queue schemes for reducing head-of-line blocking in fat-trees
The fat-tree is one of the most common topologies among the interconnection networks of the systems 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 a 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 the network performance. In that sense, we describe in this paper two simple, cost-effective strategies for dealing with the HoL-blocking problem that may appear in fat-trees with the aforementioned deterministic routing algorithm. From the results presented in the paper, we conclude that, in the mentioned environment, these proposals considerably reduce HoL-blocking without significantly increasing switch complexity and the required silicon area., This work is jointly supported by the MEC, MICINN and European Commission under projects Consolider Ingenio-2010-CSD2006-00046 and TIN2009-14475-C04, and by the Junta de Comunidades de Castilla-La Mancha under projects PCC08-0078 (PhD grant A08/048) and POII10-0289-3724.
Project:
Ministerio de Educación y Ciencia CSD2006-00046
,
Ministerio de Ciencia e Innovación TIN2009-14475-C04-01
,
Ministerio de Ciencia e Innovación TIN2009-14475-C04-03
,
Junta de Comunidades de Castilla-La Mancha PCC08-0078-9856
,
Junta de Comunidades de Castilla-La Mancha POII10-0289-3724
,
Junta de Comunidades de Castilla-La Mancha A08/048