Zobrazeno 1 - 10
of 211
pro vyhledávání: '"BOSILCA, GEORGE"'
Autor:
Abdulah, Sameh, Baker, Allison H., Bosilca, George, Cao, Qinglei, Castruccio, Stefano, Genton, Marc G., Keyes, David E., Khalid, Zubair, Ltaief, Hatem, Song, Yan, Stenchikov, Georgiy L., Sun, Ying
We present the design and scalable implementation of an exascale climate emulator for addressing the escalating computational and storage requirements of high-resolution Earth System Model simulations. We utilize the spherical harmonic transform to s
Externí odkaz:
http://arxiv.org/abs/2408.04440
Factorization and multiplication of dense matrices and tensors are critical, yet extremely expensive pieces of the scientific toolbox. Careful use of low rank approximation can drastically reduce the computation and memory requirements of these opera
Externí odkaz:
http://arxiv.org/abs/2311.07602
Structured dense matrices result from boundary integral problems in electrostatics and geostatistics, and also Schur complements in sparse preconditioners such as multi-frontal methods. Exploiting the structure of such matrices can reduce the time fo
Externí odkaz:
http://arxiv.org/abs/2311.00921
Autor:
Bouteiller, Aurelien, Bosilca, George
Scientific applications have long embraced the MPI as the environment of choice to execute on large distributed systems. The User-Level Failure Mitigation (ULFM) specification extends the MPI standard to address resilience and enable MPI applications
Externí odkaz:
http://arxiv.org/abs/2212.08755
Publikováno v:
Parallel Computing 106 (2021)
Asynchronous programming models (APM) are gaining more and more traction, allowing applications to expose the available concurrency to a runtime system tasked with coordinating the execution. While MPI has long provided support for multi-threaded com
Externí odkaz:
http://arxiv.org/abs/2112.11978
The MPI standard has long included one-sided communication abstractions through the MPI Remote Memory Access (RMA) interface. Unfortunately, the MPI RMA chapter in the 4.0 version of the MPI standard still contains both well-known and lesser known sh
Externí odkaz:
http://arxiv.org/abs/2111.08142
Publikováno v:
In Future Generation Computer Systems July 2024 156:313-324
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Slaughter, Elliott, Wu, Wei, Fu, Yuankun, Brandenburg, Legend, Garcia, Nicolai, Kautz, Wilhem, Marx, Emily, Morris, Kaleb S., Lee, Wonchan, Cao, Qinglei, Bosilca, George, Mirchandaney, Seema, Treichler, Sean, McCormick, Patrick, Aiken, Alex
We present Task Bench, a parameterized benchmark designed to explore the performance of parallel and distributed programming systems under a variety of application scenarios. Task Bench lowers the barrier to benchmarking multiple programming systems
Externí odkaz:
http://arxiv.org/abs/1908.05790
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.