Mostra el registre d'ítem simple

dc.contributor.authorGarcía, Marina
dc.contributor.authorVallejo, Enrique
dc.contributor.authorBeivide Palacio, Ramon
dc.contributor.authorValero Cortés, Mateo
dc.contributor.authorRodríguez, Germán
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors
dc.contributor.otherBarcelona Supercomputing Center
dc.date.accessioned2016-11-03T13:54:19Z
dc.date.available2016-11-03T13:54:19Z
dc.date.issued2013
dc.identifier.citationGarcía, M., Vallejo, E., Beivide, R., Valero, M., Rodríguez, G. OFAR-CM: Efficient Dragonfly networks with simple congestion management. A: IEEE Annual Symposium in High-Performance Interconnects. "IEEE 21st Annual Symposium on High-Performance Interconnects: 21-23 August 2013, San Jose, California: proceedings". San Jose, California: Institute of Electrical and Electronics Engineers (IEEE), 2013, p. 55-62.
dc.identifier.isbn978-0-7685-5103-6
dc.identifier.urihttp://hdl.handle.net/2117/91427
dc.description.abstractDragonfly networks are appealing topologies for large-scale Data center and HPC networks, that provide high throughput with low diameter and moderate cost. However, they are prone to congestion under certain frequent traffic patterns that saturate specific network links. Adaptive non-minimal routing can be used to avoid such congestion. That kind of routing employs longer paths to circumvent local or global congested links. However, if a distance-based deadlock avoidance mechanism is employed, more Virtual Channels (VCs) are required, what increases design complexity and cost. OFAR (On-the-Fly Adaptive Routing) is a previously proposed routing that decouples VCs from deadlock avoidance, making local and global misrouting affordable. However, the severity of congestion with OFAR is higher, as it relies on an escape sub network with low bisection bandwidth. Additionally, OFAR allows for unlimited misroutings on the escape sub network, leading to unbounded paths in the network and long latencies. In this paper we propose and evaluate OFAR-CM, a variant of OFAR combined with a simple congestion management (CM) mechanism which only relies on local information, specifically the credit count of the output ports in the local router. With simple escape sub networks such as a Hamiltonian ring or a tree, OFAR outperforms former proposals with distance-based deadlock avoidance. Additionally, although long paths are allowed in theory, in practice packets arrive at their destination in a small number of hops. Altogether, OFAR-CM constitutes the first practicable mechanism to the date that supports both local and global misrouting in Dragonfly networks.
dc.description.sponsorshipThe research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement n. ERC-2012-Adg-321253- RoMoL, the Spanish Ministry of Science under contracts TIN2010-21291-C02-02, TIN2012-34557, and by the European HiPEAC Network of Excellence. M. García participated in this work while affiliated with the University of Cantabria.
dc.format.extent8 p.
dc.language.isoeng
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.subjectÀrees temàtiques de la UPC::Informàtica::Arquitectura de computadors
dc.subject.lcshTelecommunication -- Traffic -- Management
dc.subject.lcshData processing service centers
dc.subject.lcshRouting (Computer network management)
dc.subject.otherDragonfly networks
dc.subject.otherCogestion management
dc.subject.otherDeadlock avoidance
dc.titleOFAR-CM: Efficient Dragonfly networks with simple congestion management
dc.typeConference report
dc.subject.lemacTelecomunicació -- Tràfic -- Gestió
dc.subject.lemacCentres informàtics
dc.subject.lemacEncaminadors (Xarxes d'ordinadors)
dc.contributor.groupUniversitat Politècnica de Catalunya. CAP - Grup de Computació d'Altes Prestacions
dc.identifier.doi10.1109/HOTI.2013.16
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://ieeexplore.ieee.org/document/6627736/
dc.rights.accessOpen Access
local.identifier.drac19029645
dc.description.versionPostprint (author's final draft)
dc.relation.projectidinfo:eu-repo/grantAgreement/EC/FP7/321253/EU/Riding on Moore's Law/ROMOL
dc.relation.projectidinfo:eu-repo/grantAgreement/MINECO/6PN/TIN2012-34557
dc.relation.projectidinfo:eu-repo/grantAgreement/EC/FP7/321253/EU/Riding on Moore's Law/ROMOL
dc.relation.projectidinfo:eu-repo/grantAgreement/EC/FP7/287759/EU/High Performance and Embedded Architecture and Compilation/HIPEAC
local.citation.authorGarcía, M.; Vallejo, E.; Beivide, R.; Valero, M.; Rodríguez, G.
local.citation.contributorIEEE Annual Symposium in High-Performance Interconnects
local.citation.pubplaceSan Jose, California
local.citation.publicationNameIEEE 21st Annual Symposium on High-Performance Interconnects: 21-23 August 2013, San Jose, California: proceedings
local.citation.startingPage55
local.citation.endingPage62


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple