Zobrazeno 1 - 10
of 295
pro vyhledávání: '"Jesper Larsson Träff"'
Publikováno v:
Forsell, M, Nikula, S, Roivainen, J, Leppänen, V & Träff, J L 2022, ' Performance and programmability comparison of the thick control flow architecture and current multicore processors ', The Journal of Supercomputing, vol. 78, no. 3, pp. 3152-3183 . https://doi.org/10.1007/s11227-021-03985-0
Commercial multicore central processing units (CPU) integrate a number of processor cores on a single chip to support parallel execution of computational tasks. Multicore CPUs can possibly improve performance over single cores for independent paralle
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::65dc516bef23bf04ef959098dbf6a4e3
https://cris.vtt.fi/en/publications/4b8b0a73-02d3-4299-84f0-56750a7c2b91
https://cris.vtt.fi/en/publications/4b8b0a73-02d3-4299-84f0-56750a7c2b91
Autor:
Jesper Larsson Träff
Publikováno v:
Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b626cc38023c4958306bce6aac9d5dc6
https://doi.org/10.1145/3490148.3538560
https://doi.org/10.1145/3490148.3538560
Publikováno v:
Proceedings of the 2nd Workshop on Performance EngineeRing, Modelling, Analysis, and VisualizatiOn Strategy.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6c69f687c625a125c7f767021c9b6401
https://doi.org/10.1145/3526063.3535353
https://doi.org/10.1145/3526063.3535353
Publikováno v:
ACM Journal of Experimental Algorithmics. 25:1-19
Communication and topology aware process mapping is a powerful approach to reduce communication time in parallel applications with known communication patterns on large, distributed memory systems. We address the problem as a quadratic assignment pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ff018e1df2d33ae642e294cc7c7aa848
https://doi.org/10.1145/3409667
https://doi.org/10.1145/3409667
Autor:
Jesper Larsson Träff
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 30:2060-2074
We study the complexity of finding communication trees with the lowest possible completion time for rooted, irregular gather and scatter collective communication operations in fully connected, $k$-ported communication networks under a linear-time tra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ac207d03c242c717f32b039714463f12
https://doi.org/10.1109/tpds.2019.2899843
https://doi.org/10.1109/tpds.2019.2899843
Autor:
Wei-keng Liao, Qiao Kang, Jesper Larsson Träff, Reda Al-Bahrani, Alok Choudhary, Ankit Agrawal
Publikováno v:
Parallel Computing. 85:220-230
MPI intergroup collective communication defines message transfer patterns between two disjoint groups of MPI processes. Such patterns occur in coupled applications, and in modern scientific application workflows, mostly with large data sizes. However
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d841f96063729b4f21f832539927923
https://doi.org/10.1016/j.parco.2019.04.015
https://doi.org/10.1016/j.parco.2019.04.015
Publikováno v:
EuroMPI
EuroMPI/USA '20: 27th European MPI Users' Group Meeting
EuroMPI/USA '20: 27th European MPI Users' Group Meeting
A major reason for the success of MPI as the standard for large-scale, distributed memory programming is the economy and orthogonality of key concepts. These very design principles suggest leaner and better support for stencil-like, sparse collective
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5d5a648090423855732fd0ac1c2c1fe6
https://doi.org/10.1145/3416315.3416319
https://doi.org/10.1145/3416315.3416319
Autor:
Jesper Larsson Träff
Publikováno v:
EuroMPI
In order to provide for type correct implementations of applications in MPI that use derived datatypes to describe complex and possibly heterogeneous data layouts, signature datatypes describing the sequence of basic datatypes comprising the complex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6a421232b7f5476258a36accd94692a3
https://doi.org/10.1145/3416315.3416324
https://doi.org/10.1145/3416315.3416324
Autor:
Sascha Hunold, Jesper Larsson Träff
Publikováno v:
CLUSTER
Many modern, high-performance systems increase the cumulated node-bandwidth by offering more than a single communication network and/or by having multiple connections to the network, such that a single processor-core cannot by itself saturate the off
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b5ed05177f79bd803da2b1427f7d415
https://doi.org/10.1109/cluster49012.2020.00037
https://doi.org/10.1109/cluster49012.2020.00037
Publikováno v:
CLUSTER
Good process-to-compute-node mappings can be decisive for well performing HPC applications. A special, important class of process-to-node mapping problems is the problem of mapping processes that communicate in a sparse stencil pattern to Cartesian g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3bd476bc421912f7dbb7b1cd1d292104
http://arxiv.org/abs/2005.09521
http://arxiv.org/abs/2005.09521
