Zobrazeno 1 - 10
of 73
pro vyhledávání: '"Philippe Pierre Pebay"'
Autor:
Phil Miller, Philippe Pierre Pebay, Matthew Tyler Bettencourt, Nicole Lemaster Slattengren, Francesco Rizzi, Jonathan Lifflander
Publikováno v:
CLUSTER
This paper explores dynamic load balancing algorithms used by asynchronous many-task (AMT), or ‘taskbased’, programming models to optimize task placement for scientific applications with dynamic workload imbalances. AMT programming models use ove
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::37ddd226f13181ee22b5c7f17c9fc7c9
https://doi.org/10.1109/cluster48925.2021.00039
https://doi.org/10.1109/cluster48925.2021.00039
Autor:
Phil Miller, Philippe Pierre Pebay, Jonathan Lifflander, Paul Stickney, Nicolas Morales, Nicole Lemaster Slattengren
Publikováno v:
ExaMPI@SC
We present the execution model of Virtual Transport (VT) a new, Asynchronous Many-Task (AMT) runtime system that provides unprecedented integration and interoperability with MPI. We have developed VT in conjunction with large production applications
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6605d735175addc31d40a9e64da24d69
https://doi.org/10.1109/exampi52011.2020.00009
https://doi.org/10.1109/exampi52011.2020.00009
Autor:
Philippe Pierre Pebay, Phil Miller, Nicole Lemaster Slattengren, Francesco Rizzi, Meriadeg Perrinel, Jonathan Lifflander, Matthew Tyler Bettencourt, Gary J. Templet
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9fd035f952245060f298dc1967ee29ab
https://doi.org/10.2172/1493825
https://doi.org/10.2172/1493825
Publikováno v:
Computational Statistics. 31:1305-1325
Formulas for incremental or parallel computation of second order central moments have long been known, and recent extensions of these formulas to univariate and multivariate moments of arbitrary order have been developed. Such formulas are of key imp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::140aec07e72b17f52d5044627fbd5004
https://doi.org/10.1007/s00180-015-0637-z
https://doi.org/10.1007/s00180-015-0637-z
Publikováno v:
IPDPS Workshops
Global collectives (reductions/aggregations) are ubiquitous and feature in nearly every application of distributed high-performance computing (HPC). While it is advisable to devise algorithms by placing collectives off the critical path of execution,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::844447ef56201132c46561d6d78f289d
https://doi.org/10.1109/ipdpsw.2018.00078
https://doi.org/10.1109/ipdpsw.2018.00078