• Open Access IconOpen Access
  • Cite Icon46
  • https://doi.org/10.1145/2451116.2451120Copy DOI Icon

Parallelizing data race detection

  • Mar 16, 2013
  • Benjamin Wester +4 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Detecting data races in multithreaded programs is a crucial part of debugging such programs, but traditional data race detectors are too slow to use routinely. This paper shows how to speed up race detection by spreading the work across multiple cores. Our strategy relies on uniparallelism, which executes time intervals of a program (called epochs) in parallel to provide scalability, but executes all threads from a single epoch on a single core to eliminate locking overhead. We use several techniques to make parallelization effective: dividing race detection into three phases, predicting a subset of the analysis state, eliminating sequential work via transitive reduction, and reducing the work needed to maintain multiple versions of analysis via factorization. We demonstrate our strategy by parallelizing a happens-before detector and a lockset-based detector. We find that uniparallelism can significantly speed up data race detection. With 4x the number of cores as the original application, our strategy speeds up the median execution time by 4.4x for a happens-before detector and 3.3x for a lockset race detector. Even on the same number of cores as the conventional detectors, the ability for uniparallelism to elide analysis locks allows it to reduce the median overhead by 13% for a happens-before detector and 8% for a lockset detector.

Similar Papers
  • Research Article
  • Citations2

Parallelizing data race detection

  • Mar 16, 2013
  • ACM SIGARCH Computer Architecture News
  • Benjamin Wester +4
  • Research Article
  • Citations3

Parallelizing data race detection

  • Mar 16, 2013
  • ACM SIGPLAN Notices
  • Benjamin Wester +4
  • Research Article
  • Citations2

VORD: A Versatile On-the-fly Race Detection Tool in OpenMP Programs

  • Jul 25, 2013
  • International Journal of Parallel Programming
  • Young-Joo Kim +2
  • Conference Article
  • Citations9

SimpleLock: Fast and Accurate Hybrid Data Race Detector

  • Dec 01, 2013
  • Misun Yu +2
  • Conference Article
  • Citations15

Kard: lightweight data race detection with per-thread memory protection

  • Apr 17, 2021
  • Adil Ahmad +3
  • Conference Article
  • Citations105

Detecting and surviving data races using complementary schedules

  • Oct 23, 2011
  • Kaushik Veeraraghavan +3
  • Conference Article

Dynamically detecting data races in multi-threaded object-oriented programs by tracing function entries and exits

  • Jul 01, 2010
  • Quan Sun +2
  • Conference Article
  • Citations134

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

  • Apr 22, 2003
  • E Pozniansky +1
  • Research Article
  • Citations44

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

  • Jun 11, 2003
  • ACM SIGPLAN Notices
  • Eli Pozniansky +1
  • Conference Article
  • Citations203

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

  • Jun 11, 2003
  • Eli Pozniansky +1
  • Book Chapter
  • Citations6

Static Data Race Detection for Java Programs with Dynamic Class Loading

  • Jan 01, 2014
  • Noriaki Yoshiura +1
  • Research Article
  • Citations136

MultiRace: efficient on‐the‐fly data race detection in multithreaded C++ programs

  • Aug 01, 2006
  • Concurrency and Computation: Practice and Experience
  • Eli Pozniansky +1
  • Book Chapter

XGBoost Dynamic Detection for Data Race in Multithreaded Programs

  • Jan 01, 2022
  • Jiaze Sun +2
  • Research Article
  • Citations14

SimpleLock+: Fast and Accurate Hybrid Data Race Detection

  • Nov 11, 2014
  • The Computer Journal
  • Misun Yu +1
  • Conference Article
  • Citations25

Low-level detection of language-level data races with LARD

  • Feb 24, 2014
  • Benjamin P Wood +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.