In EDS ansehen

User-Guided Dynamic Data Race Detection.

Gespeichert in:
Bibliographische Detailangaben
Titel: User-Guided Dynamic Data Race Detection.
Autoren: Metzger, Markus1 markus.t.metzger@intel.com, Tian, Xinmin xinmin.tian@intel.com, Tedeschi, Walfred1 walfred.tedeschi@intel.com
Quelle: International Journal of Parallel Programming. Apr2015, Vol. 43 Issue 2, p159-179. 21p.
Schlagwörter: *COMPUTER software development, *WORKFLOW, *DYNAMIC programming, THREADS (Computer programs), DEBUGGING
Abstract: Multi-threaded programming is part of mainstream software development. It adds several issues not present on serial applications. Among the issues an important one is data races, i.e. the unsynchronized access of data by multiple threads. They are particularly hard to debug since they typically occur sporadically and often invisibly corrupt the internal state. Generally, the tool used to identify those kinds of issues is a data race analyzer. Due to the subtlety of data race bugs, the user at this point would already have tried to understand the problem using an application debugger. Debuggers offer a variety of features to analyze and modify the execution state of programs. Such features are typically not offered by data race analyzers. Integrating a data race analyzer into a debugger would improve the user workflow. This is usually prohibited by the huge performance overhead of a whole-program data race analysis. We propose in this work a method to reduce the overhead by allowing the user to define the scope of the analysis. A sufficiently narrow scope reduces the performance overhead to less than 5 $$\times $$ , thus allowing its integration into a debugger. Defining the analysis scope fits naturally into the debugger workflow of focusing on one problem at a time. The work here presented has been implemented in a commercial debugger product. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Parallel Programming is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Datenbank: Business Source Index
Beschreibung
Abstract:Multi-threaded programming is part of mainstream software development. It adds several issues not present on serial applications. Among the issues an important one is data races, i.e. the unsynchronized access of data by multiple threads. They are particularly hard to debug since they typically occur sporadically and often invisibly corrupt the internal state. Generally, the tool used to identify those kinds of issues is a data race analyzer. Due to the subtlety of data race bugs, the user at this point would already have tried to understand the problem using an application debugger. Debuggers offer a variety of features to analyze and modify the execution state of programs. Such features are typically not offered by data race analyzers. Integrating a data race analyzer into a debugger would improve the user workflow. This is usually prohibited by the huge performance overhead of a whole-program data race analysis. We propose in this work a method to reduce the overhead by allowing the user to define the scope of the analysis. A sufficiently narrow scope reduces the performance overhead to less than 5 $$\times $$ , thus allowing its integration into a debugger. Defining the analysis scope fits naturally into the debugger workflow of focusing on one problem at a time. The work here presented has been implemented in a commercial debugger product. [ABSTRACT FROM AUTHOR]
ISSN:08857458
DOI:10.1007/s10766-013-0296-z