Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Linus Groner"'
Autor:
Johann Dahm, Eddie Davis, Florian Deconinck, Oliver Elbert, Rhea George, Jeremy McGibbon, Tobias Wicky, Elynn Wu, Christopher Kung, Tal Ben-Nun, Lucas Harris, Linus Groner, Oliver Fuhrer
Publikováno v:
Geoscientific Model Development, 16 (9)
Progress in leveraging current and emerging high-performance computing infrastructures using traditional weather and climate models has been slow. This has become known more broadly as the software productivity gap. With the end of Moore's law drivin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ac70d55edfc0fbd198a3bb34dacb2d8c
Autor:
Johann Dahm, Eddie Davis, Florian Deconinck, Oliver Elbert, Rhea George, Jeremy McGibbon, Tobias Wicky, Elynn Wu, Christopher Kung, Tal Ben-Nun, Lucas Harris, Linus Groner, Oliver Fuhrer
Publikováno v:
eISSN
Progress in leveraging current and emerging high-performance computing infrastructures using traditional weather and climate models has been slow. This has become known more broadly as the software productivity gap. With the end of Moore's Law drivin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f5f7fb7a6b298ccb511a0598216f8fc2
https://doi.org/10.5194/egusphere-2022-943
https://doi.org/10.5194/egusphere-2022-943
Publikováno v:
HPDC
We reduce the cost of communication and synchronization in graph processing by analyzing the fastest way to process graphs: pushing the updates to a shared state or pulling the updates to a private state. We investigate the applicability of this push
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9de9e8d912999b9a5275ba7ba307b14b
http://arxiv.org/abs/2010.16012
http://arxiv.org/abs/2010.16012
Autor:
Sascha Schmid, Torsten Hoefler, Klaus-Tycho Foerster, Linus Groner, Michael Koenig, Roger Wattenhofer
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319575858
CIAC
CIAC
We investigate the multi-agent pathfinding (MAPF) problem with n agents on graphs with n vertices: Each agent has a unique start and goal vertex, with the objective of moving all agents in parallel movements to their goal s.t. each vertex and each ed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::180fbeb81d5028f3647e186d48fe9f89
https://doi.org/10.1007/978-3-319-57586-5_21
https://doi.org/10.1007/978-3-319-57586-5_21