Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Roberto Penaranda"'
Publikováno v:
MASCOTS
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4f71cb6c5e1df7fd02998c2390d43bcb
https://doi.org/10.1109/mascots53633.2021.9614297
https://doi.org/10.1109/mascots53633.2021.9614297
Autor:
Allister Alemania, Pedro Yebenes Segura, Anupama Kurpad, Jan Zielinski, Krzysztof Raszkowski, Roberto Penaranda, Sujoy Senxiv, Steven C. Miller, Ram Huggahalli, Gene Wu, Nan Ni, Malek Musleh, Scott S. Diesing, Curt E. Bruns
Publikováno v:
MASCOTS
The explosive growth in cloud-computing and overall data center system growth has created an unprecedented demand on system architects and designers to continuously develop more complex system networks to effectively satisfy the insatiable appetite t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1258be12a0c7abb8f065fdf250dfa0cc
https://doi.org/10.1109/mascots50786.2020.9285933
https://doi.org/10.1109/mascots50786.2020.9285933
Publikováno v:
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
instname
[EN] Routing is a key design parameter in the interconnection network of large parallel computers. Routing algorithms are classified into two different categories depending on the number of routing options available for each source-destination pair:
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2243585e1d8b7c1e1d2b5f49a30aa9ab
https://doi.org/10.1016/j.parco.2017.06.004
https://doi.org/10.1016/j.parco.2017.06.004
Publikováno v:
ICCS
Procedia Computer Science
Procedia Computer Science
Routing is a key design factor to obtain the maximum performance out of interconnection networks. Depending on the number of routing options that packets may use, routing algorithms are classified into two categories. If the packet can only use a sin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::06b30389c341bccb4f0e2c72223d168f
https://doi.org/10.1016/j.procs.2013.05.432
https://doi.org/10.1016/j.procs.2013.05.432
Publikováno v:
HiPINEB@HPCA
Exascale computing systems are being built with thousands of nodes. A key component of these systems is the interconnection network. The high number of components significantly increases the probability of failure. If failures occur in the interconne
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::68ac644353c6b08fd25eae3b0ce30249
https://doi.org/10.1109/hipineb.2016.9
https://doi.org/10.1109/hipineb.2016.9
Publikováno v:
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
instname
In large-scale supercomputers, the interconnection network plays a key role in system performance. Network topology highly defines the performance and cost of the interconnection network. Direct topologies are sometimes used due to its reduced hardwa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5875dd02ecf3146dcc2f75267eeebe48
http://hdl.handle.net/10251/82062
http://hdl.handle.net/10251/82062
Publikováno v:
PDP
Routing is a key parameter in the design of the interconnection network of large parallel computers. Depending on the number of routing options available for each packet, routing algorithms can be deterministic (one available path) or adaptive (sever
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1ccd9786809662f74b8c7900d3a2a13e
https://doi.org/10.1109/pdp.2015.50
https://doi.org/10.1109/pdp.2015.50
Publikováno v:
Concurrency and Computation: Practice and Experience. 29:e4065
This work was supported by the Spanish Ministerio de Economia y Competitividad (MINECO), by FEDER funds under Grant TIN2015-66972-C5-1-R, by Programa de Ayudas de Investigacion y Desarrollo (PAID) from Universitat Politecnica de alencia and by the fi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::18061010389347c94bf6fda757c4a3b6
https://doi.org/10.1002/cpe.4065
https://doi.org/10.1002/cpe.4065
Autor:
Roberto Penaranda Cebrian, Pedro Juan López Rodríguez, José Marín, María Engracia Gómez Requena, Crispin Gomez Requena
Publikováno v:
HPCC/CSS/ICESS
Routing is a key parameter in the design of the interconnection network of large parallel computers. Depending on the number of routing options available for each packet, routing algorithms are classified into two different categories: deterministic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d2916a58e349ae36127d24a025d46292
https://doi.org/10.1109/hpcc.2014.9
https://doi.org/10.1109/hpcc.2014.9
Publikováno v:
ICPADS
In large parallel computers routing is a key design point to obtain the maximum possible performance out of the interconnection network. Routing can be classified into two categories depending on the number of routing options that a packet can use to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::94a1ca231ef778deb6e50cd7654403a1
https://doi.org/10.1109/icpads.2012.103
https://doi.org/10.1109/icpads.2012.103