• Cite Icon2
  • https://doi.org/10.1145/2786021Copy DOI Icon

TRADE

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

As other multithreaded programs, transactional memory (TM) programs are prone to race conditions. Previous work focuses on extending existing definitions of data race for lock-based applications to TM applications, which requires all transactions to be totally ordered “as if” serialized by a global lock. This approach poses implementation constraints on the STM that severely limits TM applications’ performance. This article shows that forcing total ordering among all running transactions, while sufficient, is not necessary. We introduce an alternative data race definition, relaxed transactional data race , that requires ordering of only conflicting transactions. The advantages of our relaxed definition are twofold: First, unlike the previous definition, this definition can be applied to a wide range of TMs, including those that do not enforce transaction total ordering. Second, within a single execution, it exposes a higher number of data races, which considerably reduces debugging time. Based on this definition, we propose a novel and precise race detection tool for C/C++ TM applications (TRADE), which detects data races by tracking happens-before edges among conflicting transactions. Our experiments reveal that TRADE precisely detects data races for STAMP applications running on modern STMs with overhead comparable to state-of-the-art race detectors for lock-based applications. Our experiments also show that in a single run, TRADE identifies several races not discovered by 10 separate runs of a race detection tool based on the previous data race definition.

Similar Papers
  • Dissertation

Enhancing the efficiency and practicality of software transactional memory on massively multithreaded systems

  • Mar 22, 2013
  • Gökçen Kestor
  • Conference Article
  • Citations30

TxRace

  • Mar 25, 2016
  • Tong Zhang +2
  • Research Article
  • Citations2

TxRace

  • Mar 25, 2016
  • ACM SIGARCH Computer Architecture News
  • Tong Zhang +2
  • Research Article
  • Citations1

TxRace

  • Mar 25, 2016
  • ACM SIGPLAN Notices
  • Tong Zhang +2
  • Conference Article
  • Citations7

OpenRace: An Open Source Framework for Statically Detecting Data Races

  • Nov 01, 2021
  • Bradley Swain +6
  • Conference Article
  • Citations36

Using hardware transactional memory for data race detection

  • May 01, 2009
  • Shantanu Gupta +4
  • Conference Article
  • Citations9

SimpleLock: Fast and Accurate Hybrid Data Race Detector

  • Dec 01, 2013
  • Misun Yu +2
  • Book Chapter
  • Citations6

Static Data Race Detection for Java Programs with Dynamic Class Loading

  • Jan 01, 2014
  • Noriaki Yoshiura +1
  • Book Chapter

XGBoost Dynamic Detection for Data Race in Multithreaded Programs

  • Jan 01, 2022
  • Jiaze Sun +2
  • Conference Article
  • Citations105

Detecting and surviving data races using complementary schedules

  • Oct 23, 2011
  • Kaushik Veeraraghavan +3
  • Research Article
  • Citations2

TxRace

  • Mar 25, 2016
  • ACM SIGOPS Operating Systems Review
  • Tong Zhang +2
  • 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
  • Book Chapter
  • Citations97

Generating Data Race Witnesses by an SMT-Based Analysis

  • Jan 01, 2011
  • Mahmoud Said +3
  • Conference Article
  • Citations14

T-Rex

  • Apr 14, 2014
  • Gokcen Kestor +3
  • Conference Article
  • Citations15

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

  • Apr 17, 2021
  • Adil Ahmad +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.