본문 바로가기
  • Home

A Study on Filtering Techniques for Dynamic Analysis of Data Races in Multi-threaded Programs

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2017, 22(11), pp.1-7
  • DOI : 10.9708/jksci.2017.22.11.001
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science
  • Received : October 13, 2017
  • Accepted : November 14, 2017
  • Published : November 30, 2017

Ok-Kyoon Ha 1 Hongseok Yoo 1

1경운대학교

Accredited

ABSTRACT

In this paper, we introduce three monitoring filtering techniques which reduce the overheads of dynamic data race detection. It is well known that detecting data races dynamically in multi-threaded programs is quite hard and troublesome task, because the dynamic detection techniques need to monitor all execution of a multi-threaded program and to analyse every conflicting memory and thread operations in the program. Thus, the main drawback of the dynamic analysis for detecting data races is the heavy additional time and space overheads for running the program. For the practicality, we also empirically compare the efficiency of three monitoring filtering techniques. The results using OpenMP benchmarks show that the filtering techniques are practical for dynamic data race detection, since they reduce the average runtime overhead to under 10% of that of the pure detection.

Citation status

* References for papers published after 2023 are currently being built.