License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.PARMA-DITAM.2021.2
URN: urn:nbn:de:0030-drops-136386
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/13638/
Irving, Samuel ;
Peng, Lu ;
Busch, Costas ;
Peir, Jih-Kwon
BifurKTM: Approximately Consistent Distributed Transactional Memory for GPUs
Abstract
We present BifurKTM, the first read-optimized Distributed Transactional Memory system for GPU clusters. The BifurKTM design includes: GPU KoSTM, a new software transactional memory conflict detection scheme that exploits relaxed consistency to increase throughput; and KoDTM, a Distributed Transactional Memory model that combines the Data- and Control- flow models to greatly reduce communication overheads.
Despite the allure of huge speedups, GPUs are limited in use due to their programmability and extreme sensitivity to workload characteristics. These become daunting concerns when considering a distributed GPU cluster, wherein a programmer must design algorithms to hide communication latency by exploiting data regularity, high compute intensity, etc. The BifurKTM design allows GPU programmers to exploit a new workload characteristic: the percentage of the workload that is Read-Only (e.g. reads but does not modify shared memory), even when this percentage is not known in advance. Programmers designate transactions that are suitable for Approximate Consistency, in which transactions "appear" to execute at the most convenient time for preventing conflicts. By leveraging Approximate Consistency for Read-Only transactions, the BifurKTM runtime system offers improved performance, application flexibility, and programmability without introducing any errors into shared memory.
Our experiments show that Approximate Consistency can improve BkTM performance by up to 34x in applications with moderate network communication utilization and a read-intensive workload. Using Approximate Consistency, BkTM can reduce GPU-to-GPU network communication by 99%, reduce the number of aborts by up to 100%, and achieve an average speedup of 18x over a similarly sized CPU cluster while requiring minimal effort from the programmer.
BibTeX - Entry
@InProceedings{irving_et_al:OASIcs.PARMA-DITAM.2021.2,
author = {Irving, Samuel and Peng, Lu and Busch, Costas and Peir, Jih-Kwon},
title = {{BifurKTM: Approximately Consistent Distributed Transactional Memory for GPUs}},
booktitle = {12th Workshop on Parallel Programming and Run-Time Management Techniques for Many-core Architectures and 10th Workshop on Design Tools and Architectures for Multicore Embedded Computing Platforms (PARMA-DITAM 2021)},
pages = {2:1--2:15},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-181-8},
ISSN = {2190-6807},
year = {2021},
volume = {88},
editor = {Bispo, Jo\~{a}o and Cherubin, Stefano and Flich, Jos\'{e}},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/13638},
URN = {urn:nbn:de:0030-drops-136386},
doi = {10.4230/OASIcs.PARMA-DITAM.2021.2},
annote = {Keywords: GPU, Distributed Transactional Memory, Approximate Consistency}
}
|
Keywords: |
|
GPU, Distributed Transactional Memory, Approximate Consistency |
|
Collection: |
|
12th Workshop on Parallel Programming and Run-Time Management Techniques for Many-core Architectures and 10th Workshop on Design Tools and Architectures for Multicore Embedded Computing Platforms (PARMA-DITAM 2021) |
|
Issue Date: |
|
2021 |
|
Date of publication: |
|
02.03.2021 |
