Detailed Information
Cited 1 time in 
Cited 1 time in 
Cited 1 time in
Metadata Downloads
Detecting First Races in Shared-Memory Parallel Programs with Random Synchronization
- Authors
- Park, Hee-Dong; Jun, Yong-Kee
- Issue Date
- 2012
- Publisher
- SPRINGER-VERLAG BERLIN
- Keywords
- data race; first race; post-mortem analysis; concurrent programming; parallel program debugging; random synchronization
- Citation
- COMPUTER APPLICATIONS FOR GRAPHICS, GRID COMPUTING, AND INDUSTRIAL ENVIRONMENT, v.351, pp 165 - +
- Indexed
- SCOPUS
- Journal Title
- COMPUTER APPLICATIONS FOR GRAPHICS, GRID COMPUTING, AND INDUSTRIAL ENVIRONMENT
- Volume
- 351
- Start Page
- 165
- End Page
- +
- ISSN
- 1865-0929
1865-0937
- Abstract
- Detecting data races is a hard problem when debugging shared memory parallel programs, because the races could exhibit unpredictable results in execution of programs. It is even harder for programmers to decide whether or how the reported data races can appear in the actual program executions. Previous techniques for detecting races cannot provide method to discover first races in parallel programs with random synchronization. We present an algorithm, in this paper, which extracts first races to occur by comparing the concurrency of the traced information with the candidate accesses which are from a particular execution of parallel programs.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - 공과대학 > Department of Aerospace and Software Engineering > Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.