LLOV: A Fast Static Data-Race Checker for OpenMP Programs

22Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the era of Exascale computing, writing efficient parallel programs is indispensable, and, at the same time, writing sound parallel programs is very difficult. Specifying parallelism with frameworks such as OpenMP is relatively easy, but data races in these programs are an important source of bugs. In this article, we propose LLOV, a fast, lightweight, language agnostic, and static data race checker for OpenMP programs based on the LLVM compiler framework. We compare LLOV with other state-of-the-art data race checkers on a variety of well-established benchmarks. We show that the precision, accuracy, and the F1 score of LLOV is comparable to other checkers while being orders of magnitude faster. To the best of our knowledge, LLOV is the only tool among the state-of-the-art data race checkers that can verify a C/C++ or FORTRAN program to be data race free.

Cite

CITATION STYLE

APA

Bora, U., Das, S., Kukreja, P., Joshi, S., Upadrasta, R., & Rajopadhye, S. (2020). LLOV: A Fast Static Data-Race Checker for OpenMP Programs. ACM Transactions on Architecture and Code Optimization, 17(4). https://doi.org/10.1145/3418597

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free