• Cite Icon244
  • https://doi.org/10.1145/2043556.2043587Copy DOI Icon

Dthreads

  • Oct 23, 2011
  • Tongping Liu +2 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Multithreaded programming is notoriously difficult to get right. A key problem is non-determinism, which complicates debugging, testing, and reproducing errors. One way to simplify multithreaded programming is to enforce deterministic execution, but current deterministic systems for C/C++ are incomplete or impractical. These systems require program modification, do not ensure determinism in the presence of data races, do not work with general-purpose multithreaded programs, or run up to 8.4× slower than pthreads.

Similar Papers
  • Conference Article

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

  • Jul 01, 2010
  • Quan Sun +2
  • Research Article
  • Citations61

Assessment of stochastic and deterministic models of 6304 quasar lightcurves from SDSS Stripe 82

  • Jun 01, 2013
  • Astronomy & Astrophysics
  • R Andrae +2
  • Conference Article
  • Citations3

Accelerating schedule space exploration of multi-threaded programs with GPUs

  • Nov 01, 2016
  • Prakhar Banga +3
  • Conference Article
  • Citations423

Race directed random testing of concurrent programs

  • Jun 07, 2008
  • Koushik Sen
  • Research Article
  • Citations58

Race directed random testing of concurrent programs

  • May 30, 2008
  • ACM SIGPLAN Notices
  • Koushik Sen
  • Research Article
  • Citations1

Checking Just Pairs of Threads for Efficient and Scalable Incremental Verification of Multithreaded Programs

  • Jan 10, 2023
  • ACM SIGSOFT Software Engineering Notes
  • Pavel Parízek +1
  • Conference Article
  • Citations271

Automatically classifying benign and harmful data races using replay analysis

  • Jun 10, 2007
  • Satish Narayanasamy +4
  • Research Article
  • Citations46

Automatically classifying benign and harmful data races using replay analysis

  • Jun 10, 2007
  • ACM SIGPLAN Notices
  • Satish Narayanasamy +4
  • Research Article
  • Citations31

Exploiting parallelism in deterministic shared memory multiprocessing

  • Feb 18, 2012
  • Journal of Parallel and Distributed Computing
  • Xu Zhou +3
  • Book Chapter
  • Citations12

Localizing Defects in Multithreaded Programs by Mining Dynamic Call Graphs

  • Jan 01, 2010
  • Frank Eichinger +3
  • Conference Article
  • Citations16

Multithreaded programming in Cilk

  • Jul 27, 2007
  • Matteo Frigo
  • Conference Article
  • Citations9

SimpleLock: Fast and Accurate Hybrid Data Race Detector

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

Shuffling

  • Aug 24, 2014
  • Kishore Kumar Pusukuri +2
  • Research Article
  • Citations7

Automated dynamic detection of busy–wait synchronizations

  • Mar 23, 2009
  • Software: Practice and Experience
  • Chen Tian +3
  • Conference Article
  • Citations33

Predictive Typestate Checking of Multithreaded Java Programs

  • Sep 01, 2008
  • Pallavi Joshi +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.