HardRace: A Dynamic Data Race Monitor for Production Use

• URL: http://arxiv.org/abs/2410.18412v2
• Date: Thu, 19 Dec 2024 07:57:49 GMT
• Title: HardRace: A Dynamic Data Race Monitor for Production Use
• Abstract summary: Data races are critical issues in multithreaded program, leading to unpredictable, catastrophic and difficult-to-diagnose problems.<n>We introduce HardRace, a data race monitor to detect races on-the-fly while with sufficiently low runtime overhead and high detection capability.
• Score: 15.566618111423702
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Data races are critical issues in multithreaded program, leading to unpredictable, catastrophic and difficult-to-diagnose problems. Despite the extensive in-house testing, data races often escape to deployed software and manifest in production runs. Existing approaches suffer from either prohibitively high runtime overhead or incomplete detection capability. In this paper, we introduce HardRace, a data race monitor to detect races on-the-fly while with sufficiently low runtime overhead and high detection capability. HardRace firstly employs sound static analysis to determine a minimal set of essential memory accesses relevant to data races. It then leverages hardware trace instruction, i.e., Intel PTWRITE, to selectively record only these memory accesses and thread synchronization events during execution with negligible runtime overhead. Given the tracing data, HardRace performs standard data race detection algorithms to timely report potential races occurred in production runs. The experimental evaluations show that HardRace outperforms state-of-the-art tools like ProRace and Kard in terms of both runtime overhead and detection capability -- HardRace can detect all kinds of data races in read-world applications while maintaining a negligible overhead, less than 2% on average.

Related papers

• Towards an Accurate GPU Data Race Detector [3.031706914582872]
  Data races in GPU programs pose a threat to the reliability of GPU-accelerated software stacks.<n>Prior works proposed various dynamic (runtime) and static (compile-time) techniques to detect races in GPU programs.<n>We create HGRD, a new state-of-the-art static analysis technique that performs a holistic analysis of both CPU and GPU code.
  arXiv  Detail & Related papers  (2026-04-02T14:35:49Z)
• Compiling Away the Overhead of Race Detection [4.072903728718951]
  Dynamic data race detectors are indispensable for flagging errors in software, but their high runtime overhead limits their adoption.<n>We introduce a suite of interprocedural static analyses to eliminate instrumentation for provably race-free accesses.<n>Our approach significantly reduces race detection overhead, achieving a geomean speedup of 1.34x, with peak speedups reaching 2.5x under high thread contention.
  arXiv  Detail & Related papers  (2025-12-05T09:26:08Z)
• What You Have is What You Track: Adaptive and Robust Multimodal Tracking [72.92244578461869]
  We present the first comprehensive study on tracker performance with temporally incomplete multimodal data.<n>Our model achieves SOTA performance across 9 benchmarks, excelling in both conventional complete and missing modality settings.
  arXiv  Detail & Related papers  (2025-07-08T11:40:21Z)
• A Racing Dataset and Baseline Model for Track Detection in Autonomous Racing [8.652993697080147]
  RoRaTrack is a novel dataset that contains annotated multi-camera image data from racing scenarios for track detection. We propose RaceGAN, a baseline model based on a Generative Adversarial Network (GAN) that effectively addresses these challenges. The proposed model demonstrates superior performance compared to current state-of-the-art machine learning models in track detection.
  arXiv  Detail & Related papers  (2025-02-19T19:43:31Z)
• BlinkTrack: Feature Tracking over 100 FPS via Events and Images [50.98675227695814]
  We propose a novel framework, BlinkTrack, which integrates event data with RGB images for high-frequency feature tracking. Our method extends the traditional Kalman filter into a learning-based framework, utilizing differentiable Kalman filters in both event and image branches. Experimental results indicate that BlinkTrack significantly outperforms existing event-based methods.
  arXiv  Detail & Related papers  (2024-09-26T15:54:18Z)
• Temporal Correlation Meets Embedding: Towards a 2nd Generation of JDE-based Real-Time Multi-Object Tracking [52.04679257903805]
  Joint Detection and Embedding (JDE) trackers have demonstrated excellent performance in Multi-Object Tracking (MOT) tasks. Our tracker, named TCBTrack, achieves state-of-the-art performance on multiple public benchmarks.
  arXiv  Detail & Related papers  (2024-07-19T07:48:45Z)
• Optimistic Prediction of Synchronization-Reversal Data Races [6.407713444542916]
  Dynamic data race detection has emerged as a key technique for ensuring reliability of concurrent software in practice. In this work, we identify a class of data races, called Optimistic Sync(hronization)-Reversal races that can be detected in a tractable manner. We also propose a sound algorithm OSR for detecting all optimistic sync-reversal data races in overall quadratic time.
  arXiv  Detail & Related papers  (2024-01-11T03:34:21Z)
• DataRaceBench V1.4.1 and DataRaceBench-ML V0.1: Benchmark Suites for Data Race Detection [23.240375422302666]
  Data races pose a significant threat in multi-threaded parallel applications due to their negative impact on program correctness. Open-source benchmark suite, DataRaceBench, is crafted to assess these data race detection tools in a systematic and measurable manner. This paper introduces a derived dataset named DataRaceBench-ML (DRB-ML).
  arXiv  Detail & Related papers  (2023-08-16T16:23:13Z)
• Automatic Detection, Validation and Repair of Race Conditions in Interrupt-Driven Embedded Software [17.564883311453134]
  We present SDRacer, an automated framework that can detect, validate and repair race conditions in interrupt-driven embedded software. We evaluate SDRacer on nine real-world embedded programs written in C language.
  arXiv  Detail & Related papers  (2023-05-29T03:22:00Z)
• TDT: Teaching Detectors to Track without Fully Annotated Videos [2.8292841621378844]
  One-stage trackers that predict both detections and appearance embeddings in one forward pass received much attention. Our proposed one-stage solution matches the two-stage counterpart in quality but is 3 times faster.
  arXiv  Detail & Related papers  (2022-05-11T15:56:17Z)
• Visible-Thermal UAV Tracking: A Large-Scale Benchmark and New Baseline [80.13652104204691]
  In this paper, we construct a large-scale benchmark with high diversity for visible-thermal UAV tracking (VTUAV) We provide a coarse-to-fine attribute annotation, where frame-level attributes are provided to exploit the potential of challenge-specific trackers. In addition, we design a new RGB-T baseline, named Hierarchical Multi-modal Fusion Tracker (HMFT), which fuses RGB-T data in various levels.
  arXiv  Detail & Related papers  (2022-04-08T15:22:33Z)
• Robust Event Classification Using Imperfect Real-world PMU Data [58.26737360525643]
  We study robust event classification using imperfect real-world phasor measurement unit (PMU) data. We develop a novel machine learning framework for training robust event classifiers.
  arXiv  Detail & Related papers  (2021-10-19T17:41:43Z)
• Hard Occlusions in Visual Object Tracking [12.502821224144151]
  We benchmark the performance of recent state-of-the-art trackers (SOTA) on hard scenarios such as in-plane rotation. Results show that hard occlusions remain a very challenging problem for SOTA trackers. The varying nature of tracker performance based on specific categories suggests that the common tracker rankings using averaged single performance scores are not adequate to gauge tracker performance in real-world scenarios.
  arXiv  Detail & Related papers  (2020-09-10T11:42:21Z)
• Federated Doubly Stochastic Kernel Learning for Vertically Partitioned Data [93.76907759950608]
  We propose a doubly kernel learning algorithm for vertically partitioned data. We show that FDSKL is significantly faster than state-of-the-art federated learning methods when dealing with kernels.
  arXiv  Detail & Related papers  (2020-08-14T05:46:56Z)
• Cascaded Regression Tracking: Towards Online Hard Distractor Discrimination [202.2562153608092]
  We propose a cascaded regression tracker with two sequential stages. In the first stage, we filter out abundant easily-identified negative candidates. In the second stage, a discrete sampling based ridge regression is designed to double-check the remaining ambiguous hard samples.
  arXiv  Detail & Related papers  (2020-06-18T07:48:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.