基于OpenMP感知的MHP分析改进的静态数据竞争检测
OpenMP aware MHP Analysis for Improved Static Data-Race Detection
摘要:
数据竞争是并发程序中错误的一个主要来源,它会导致人力和时间的损失以及由于系统故障而导致的数据丢失。在HPC社区中使用的事实上的共享内存并行框架OpenMP也受到数据竞争的影响。为了检测OpenMP程序中的竞争条件并提高周转时间和/或开发人员的生产力,我们在LLVM编译器框架中提出了一种基于数据流分析的快速静态数据竞争检查器。我们的工具可以检测种族的存在或不存在显式的障碍,隐式或显式同步。此外,我们的工具有效地为OpenMP目标卸载结构,也支持常用的OpenMP结构。我们形式化并提供了一个数据流分析框架来执行OpenMP程序的相位间隔分析(PIA)。相位间隔,然后用于计算MHP(及其补充NHP)集的程序,这反过来又被用来检测数据竞争静态。我们评估我们的工作使用多个OpenMP竞争检测基准和现实世界中的应用程序。我们的实验表明,该检查器在各种性能指标方面与最先进的检查器相当,准确率约为90%,几乎完美的召回率,并且运行时间和内存占用量显着降低。
英文摘要:
Data races, a major source of bugs in concurrent programs, can result in loss of manpower and time as well as data loss due to system failures. OpenMP, the de facto shared memory parallelism framework used in the HPC community, also suffers from data races. To detect race conditions in OpenMP programs and improve turnaround time and/or developer productivity, we present a data flow analysis based, fast, static data race checker in the LLVM compiler framework. Our tool can detect races in the presence or absence of explicit barriers, with implicit or explicit synchronization. In addition, our tool effectively works for the OpenMP target offloading constructs and also supports the frequently used OpenMP constructs. We formalize and provide a data flow analysis framework to perform Phase Interval Analysis (PIA) of OpenMP programs. Phase intervals are then used to compute the MHP (and its complement NHP) sets for the programs, which, in turn, are used to detect data races statically. We evaluate our work using multiple OpenMP race detection benchmarks and real world applications. Our experiments show that the checker is comparable to the state-of-the-art in various performance metrics with around 90% accuracy, almost perfect recall, and significantly lower runtime and memory footprint.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。