NDLI: GRace:a low-overhead mechanism for detecting data races in GPU programs

Content Provider	ACM Digital Library
Author	Ravi, Vignesh T. Zheng, Mai Qin, Feng Agrawal, Gagan
Abstract	In recent years, GPUs have emerged as an extremely cost-effective means for achieving high performance. Many application developers, including those with no prior parallel programming experience, are now trying to scale their applications using GPUs. While languages like CUDA and OpenCL have eased GPU programming for non-graphical applications, they are still explicitly parallel languages. All parallel programmers, particularly the novices, need tools that can help ensuring the correctness of their programs. Like any multithreaded environment, data races on GPUs can severely affect the program reliability. Thus, tool support for detecting race conditions can significantly benefit GPU application developers. Existing approaches for detecting data races on CPUs or GPUs have one or more of the following limitations: 1) being illsuited for handling non-lock synchronization primitives on GPUs; 2) lacking of scalability due to the state explosion problem; 3) reporting many false positives because of simplified modeling; and/or 4) incurring prohibitive runtime and space overhead. In this paper, we propose GRace, a new mechanism for detecting races in GPU programs that combines static analysis with a carefully designed dynamic checker for logging and analyzing information at runtime. Our design utilizes GPUs memory hierarchy to log runtime data accesses efficiently. To improve the performance, GRace leverages static analysis to reduce the number of statements that need to be instrumented. Additionally, by exploiting the knowledge of thread scheduling and the execution model in the underlying GPUs, GRace can accurately detect data races with no false positives reported. Based on the above idea, we have built a prototype of GRace with two schemes, i.e., GRace-stmt and GRace-addr, for NVIDIA GPUs. Both schemes are integrated with the same static analysis. We have evaluated GRace-stmt and GRace-addr with three data race bugs in three GPU kernel functions and also have compared them with the existing approach, referred to as B-tool. Our experimental results show that both schemes of GRace are effective in detecting all evaluated cases with no false positives, whereas Btool reports many false positives for one evaluated case. On the one hand, GRace-addr incurs low runtime overhead, i.e., 22-116%, and low space overhead, i.e., 9-18MB, for the evaluated kernels. On the other hand, GRace-stmt offers more help in diagnosing data races with larger overhead.
Starting Page	135
Ending Page	146
Page Count	12
File Format	PDF
ISSN	03621340 15581160
DOI	10.1145/2038037.1941574
Journal	ACM SIGPLAN Notices (SIGP)
Volume Number	46
Issue Number	8
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1983-05-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Multithreading Concurrency Data race Gpu Cuda
Content Type	Text
Resource Type	Article
Subject	Computer Graphics and Computer-Aided Design Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

GRace: a low-overhead mechanism for detecting data races in GPU programs

GMRace: Detecting Data Races in GPU Programs via a Low-Overhead Scheme

Efficient on-the-fly data race detection in multithreaded C++ programs

Adversarial memory for detecting destructive races

GPUVerify:a verifier for GPU kernels

Dynamic race detection for C++11

Race detection for Android applications

PACER:proportional detection of data races

Barrier invariants:a shared state abstraction for the analysis of data-dependent GPU kernels

GRace:a low-overhead mechanism for detecting data races in GPU programs

Similar Documents

GRace: a low-overhead mechanism for detecting data races in GPU programs

GMRace: Detecting Data Races in GPU Programs via a Low-Overhead Scheme

Efficient on-the-fly data race detection in multithreaded C++ programs

Adversarial memory for detecting destructive races

GPUVerify:a verifier for GPU kernels

Dynamic race detection for C++11

Race detection for Android applications

PACER:proportional detection of data races

Barrier invariants:a shared state abstraction for the analysis of data-dependent GPU kernels

GRace:a low-overhead mechanism for detecting data races in GPU programs