Enhancing MPI remote memory access model for distributed-memory systems through one-sided broadcast implementation
Guardat en:
| Publicat a: | Journal of Physics: Conference Series vol. 2697, no. 1 (Feb 2024), p. 012035 |
|---|---|
| Autor principal: | |
| Altres autors: | |
| Publicat: |
IOP Publishing
|
| Matèries: | |
| Accés en línia: | Citation/Abstract Full Text - PDF |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 2924353985 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 1742-6588 | ||
| 022 | |a 1742-6596 | ||
| 024 | 7 | |a 10.1088/1742-6596/2697/1/012035 |2 doi | |
| 035 | |a 2924353985 | ||
| 045 | 2 | |b d20240201 |b d20240229 | |
| 100 | 1 | |a Abuelsoud, M M |u Department of Computer Science and Engineering, Saint Petersburg Electrotechnical University “LETI” , ul. Professora Popova 5, Saint Petersburg 197022 , Russia | |
| 245 | 1 | |a Enhancing MPI remote memory access model for distributed-memory systems through one-sided broadcast implementation | |
| 260 | |b IOP Publishing |c Feb 2024 | ||
| 513 | |a Journal Article | ||
| 520 | 3 | |a Efficiently processing vast and expanding data volumes is a pressing challenge. Traditional high-performance computers, utilizing distributed-memory architecture and a message-passing model, grapple with synchronization issues, hampering their ability to keep up with the growing demands. Remote Memory Access (RMA), often referred to as one-sided MPI communications, offers a solution by allowing a process to directly access another process’s memory, eliminating the need for message exchange and significantly boosting performance. Unfortunately, the existing MPI RMA standard lacks a collective operation interface, limiting efficiency. To overcome this constraint, we introduce an algorithm design that enables efficient parallelizable collective operations within the RMA framework. Our study focuses primarily on the advantages of collective operations, using the broadcast algorithm as a case study. Our implementations surpass traditional methods, highlighting the promising potential of this technique, as indicated by initial performance tests. | |
| 653 | |a Synchronism | ||
| 653 | |a Algorithms | ||
| 653 | |a Message passing | ||
| 653 | |a Distributed memory | ||
| 653 | |a Performance tests | ||
| 700 | 1 | |a Kogutenko, A A |u Department of Computer Science and Engineering, Saint Petersburg Electrotechnical University “LETI” , ul. Professora Popova 5, Saint Petersburg 197022 , Russia | |
| 773 | 0 | |t Journal of Physics: Conference Series |g vol. 2697, no. 1 (Feb 2024), p. 012035 | |
| 786 | 0 | |d ProQuest |t Advanced Technologies & Aerospace Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/2924353985/abstract/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text - PDF |u https://www.proquest.com/docview/2924353985/fulltextPDF/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch |