원문정보
보안공학연구지원센터(IJMUE)
International Journal of Multimedia and Ubiquitous Engineering
Vol.9 No.4
2014.04
pp.199-208
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
Data races are the hardest defect to handle in multithreaded programs due to the non-deterministic interleaving of concurrent threads. It incurs the expensive costs of dynamic data race detection to monitor all of memory operations to shared memory locations. This paper presents a hierarchical filtering method that removes unnecessary monitoring memory operations from three levels of binary image, and evaluates empirically the effectiveness of the filtering method for dynamic data race detection. The empirical results using a set of benchmarks show that our filtering method reduces the average runtime overhead to over 50% of dynamic data race detection.
목차
Abstract
1. Introduction
2. Background
2.1. Data Races in Multithreaded Programs
2.2. Data Race Detection in Multithreaded Programs
3. Motivation
4. The Filtering for Dynamic Data Race Detection
4.1. The Filtering for IML
4.2. The Filtering for SEL
4.3. The Filtering for INL
5. Evaluation
5.1. Implementation and Experimentation
5.2. Results and Analysis
6. Conclusion
Acknowledgements
References
1. Introduction
2. Background
2.1. Data Races in Multithreaded Programs
2.2. Data Race Detection in Multithreaded Programs
3. Motivation
4. The Filtering for Dynamic Data Race Detection
4.1. The Filtering for IML
4.2. The Filtering for SEL
4.3. The Filtering for INL
5. Evaluation
5.1. Implementation and Experimentation
5.2. Results and Analysis
6. Conclusion
Acknowledgements
References
저자정보
참고문헌
자료제공 : 네이버학술정보