Open AccessRace Condition Detection Algorithms
Author(s) -
B. Tirapathi Reddy,
A. Hari Kishore,
P. V. S. Krishna Manmayi,
Mahadev A. Gawas
Publication year - 2019
Publication title -
international journal of engineering and advanced technology
Language(s) - English
Resource type - Journals
ISSN - 2249-8958
DOI - 10.35940/ijeat.b2696.129219
Subject(s) - computer science , parallel computing , parallelism (grammar) , construct (python library) , parallel programming model , programming paradigm , kernel (algebra) , programming language , mathematics , combinatorics
A data race is similar to any other bugs in software application. Data race will result in the execution of the program unpredictable. There are 46 documented races in Linux kernel. OpenMP is an Application programming interface for shared programming model. It is a construct based model which works on fork join parallelism. OpenMP achieved node level parallelism and can manage data in single instruction multiple data and single program multiple data parallelism by executing different constructs like work sharing and parallel constructs. In any shared programming model, variables are shared by multiple threads in the program to execute different tasks by different threads. OpenMP is used to achieve parallelism by creating shared variable environment but there are chances to have data races in OpenMP programs. In this paper we discuss different algorithms to detect data races in OpenMP programs.