Show simple item record

dc.contributor.authorFuentes, Pablo
dc.contributor.authorVallejo, Enrique
dc.contributor.authorCamarero, Cristóbal
dc.contributor.authorBeivide Palacio, Ramon
dc.contributor.authorValero Cortés, Mateo
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors
dc.contributor.otherBarcelona Supercomputing Center
dc.date.accessioned2016-11-24T14:10:43Z
dc.date.available2018-01-02T01:30:48Z
dc.date.issued2016-12
dc.identifier.citationFuentes, P., Vallejo, E., Camarero, C., Beivide, R., Valero, M. Network unfairness in dragonfly topologies. "Journal of supercomputing", Desembre 2016, vol. 72, núm. 12, p. 4468-4496.
dc.identifier.issn0920-8542
dc.identifier.urihttp://hdl.handle.net/2117/97185
dc.description.abstractDragonfly networks arrange network routers in a two-level hierarchy, providing a competitive cost-performance solution for large systems. Non-minimal adaptive routing (adaptive misrouting) is employed to fully exploit the path diversity and increase the performance under adversarial traffic patterns. Network fairness issues arise in the dragonfly for several combinations of traffic pattern, global misrouting and traffic prioritization policy. Such unfairness prevents a balanced use of the resources across the network nodes and degrades severely the performance of any application running on an affected node. This paper reviews the main causes behind network unfairness in dragonflies, including a new adversarial traffic pattern which can easily occur in actual systems and congests all the global output links of a single router. A solution for the observed unfairness is evaluated using age-based arbitration. Results show that age-based arbitration mitigates fairness issues, especially when using in-transit adaptive routing. However, when using source adaptive routing, the saturation of the new traffic pattern interferes with the mechanisms employed to detect remote congestion, and the problem grows with the network size. This makes source adaptive routing in dragonflies based on remote notifications prone to reduced performance, even when using age-based arbitration.
dc.format.extent29 p.
dc.language.isoeng
dc.subjectÀrees temàtiques de la UPC::Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadors
dc.subject.lcshRouting (Computer network management)
dc.subject.lcshTelecommunication -- Traffic -- Management
dc.subject.otherDragonfly
dc.subject.otherFairness
dc.subject.otherNetworking
dc.titleNetwork unfairness in dragonfly topologies
dc.typeArticle
dc.subject.lemacEncaminadors (Xarxes d'ordinadors)
dc.subject.lemacTelecomunicació -- Tràfic -- Gestió
dc.contributor.groupUniversitat Politècnica de Catalunya. CAP - Grup de Computació d'Altes Prestacions
dc.identifier.doi10.1007/s11227-016-1758-z
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://link.springer.com/article/10.1007/s11227-016-1758-z
dc.rights.accessOpen Access
local.identifier.drac19288079
dc.description.versionPostprint (author's final draft)
dc.relation.projectidinfo:eu-repo/grantAgreement/ES/1PE/TIN2013-46957-C2-2-P
dc.relation.projectidinfo:eu-repo/grantAgreement/MINECO/1PE/TIN2013-46957-C2-2-P
dc.relation.projectidinfo:eu-repo/grantAgreement/EC/H2020/687698/EU/High Performance and Embedded Architecture and Compilation/HiPEAC
local.citation.authorFuentes, P.; Vallejo, E.; Camarero, C.; Beivide, R.; Valero, M.
local.citation.publicationNameJournal of supercomputing
local.citation.volume72
local.citation.number12
local.citation.startingPage4468
local.citation.endingPage4496


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder