Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Crispín Gómez"'
Autor:
Jesus Escudero-Sahuquillo, Pedro Javier Garcia, Pedro Yebenes, Crispín Gómez, Francisco J. Alfaro, Francisco J. Quiles, Jose Rocher-Gonzalez, José Duato
Publikováno v:
ACM Transactions on Architecture and Code Optimization. 16:1-26
Hybrid and direct topologies are cost-efficient and scalable options to interconnect thousands of end nodes in high-performance computing (HPC) systems. They offer a rich path diversity, high bisection bandwidth, and a reduced diameter guaranteeing l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b34513b00eaa4be0522c31c844c35a5e
https://doi.org/10.1145/3319805
https://doi.org/10.1145/3319805
Publikováno v:
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
instname
[EN] Current multicore systems implement multiple hardware prefetchers to tolerate long main memory latencies. However, memory bandwidth is a scarce shared resource which becomes critical with the increasing core count. To deal with this fact, recent
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cb3cada3177e6cbe3b3e2970f62afb30
http://hdl.handle.net/10251/121783
http://hdl.handle.net/10251/121783
Publikováno v:
Computer Applications in Engineering Education. 23:724-732
The architecture of current processors has experienced great changes in the last years, leading to sophisticated multithreaded multicore processors. The inherent complexity of such processors makes difficult to update processor teaching to include cu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c54aecce013345a9f5c229e0a4a6cdf4
https://doi.org/10.1002/cae.21645
https://doi.org/10.1002/cae.21645
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:
PDP
Prefetching significantly reduces the memory latencies of a wide range of applications and thus increases the system performance. However, as a speculative technique, prefetching may also noticeably increase the number of memory accesses, which in tu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::40dad2a00216a2470b28e8087d1b00cd
https://doi.org/10.1109/pdp.2016.47
https://doi.org/10.1109/pdp.2016.47
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:
Concurrency and Computation: Practice and Experience. 23:86-99
Networks on-chip (NoCs) interconnect the components located inside a chip. In multicore chips, NoCs have a strong impact on the overall system performance. NoC bandwidth is limited by the critical path delay. Recent works show that the critical path
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3a8920ba4149bc3fb40d2cfc8d5cf791
https://doi.org/10.1002/cpe.1606
https://doi.org/10.1002/cpe.1606
Publikováno v:
IEEE Computer Architecture Letters. 7:49-52
The fat-tree is one of the most widely-used topologies by interconnection network manufacturers. Recently, it has been demonstrated that a deterministic routing algorithm that optimally balances the network traffic can not only achieve almost the sam
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::64cf57bda264150b3a1b12cb0f087b21
https://doi.org/10.1109/l-ca.2008.8
https://doi.org/10.1109/l-ca.2008.8
Autor:
Crispín Gómez Requena
Publikováno v:
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
Riunet
instname
Riunet
Actualmente, los clústeres de PCs están considerados como una alternativa eficiente a la hora de construir supercomputadores en los que miles de nodos de computación se conectan mediante una red de interconexión. La red de interconexión tiene qu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4aee329bd5c8d0c19c4da1072ea708d8
https://doi.org/10.4995/thesis/10251/8856
https://doi.org/10.4995/thesis/10251/8856