A Distributed Hash Table using One-sided Communication in MPI
| dc.contributor.author | Sobe, Peter | |
| dc.contributor.author | Graupner, Tom | |
| dc.contributor.author | Hennig, Florian | |
| dc.date.accessioned | 2020-03-11T00:06:23Z | |
| dc.date.available | 2020-03-11T00:06:23Z | |
| dc.date.issued | 2017 | |
| dc.description.abstract | The Message Passing Interface (MPI) can be applied to implement data structures that are distributed across process memory, such as distributed arrays or hash tables. In this paper a hash table implementation is described that employs one-sided communication in case of collision-free access. Collisions of data entries within the hash table are treated using dynamic overflow memory and two-sided communication. This leads to a two-level communication architecture that combines one-sided and two-sided operations in a data structure and the related access operations. This approach circumvents the problem of dynamic and unforeseen size and arrangement of data structures in shared memory that would be hard to manage using solely one-sided communication. | en |
| dc.identifier.pissn | 0177-0454 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/31943 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e.V., Fachgruppe PARS | |
| dc.relation.ispartof | PARS-Mitteilungen: Vol. 34, Nr. 1 | |
| dc.title | A Distributed Hash Table using One-sided Communication in MPI | en |
| dc.type | Text/Journal Article | |
| gi.citation.endPage | 77 | |
| gi.citation.publisherPlace | Berlin | |
| gi.citation.startPage | 66 |
Dateien
Originalbündel
1 - 1 von 1