Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 27 for “"Data Race Detection"”.

  1. Dynamic data race detection and healing

    … lead to concurrency faults such as deadlock and data race that are notoriously difficult to isolate, detect, and repair. Data races, which involves two concurrent accesses to the same data where at least one is a write, are the most common concurrency faults. As our first step, we investigate the …

    nebraska Repository record for Dynamic data race detection and healing (opens in a new tab)

  2. Dynamic data race detection for OpenMP programs

    … unordered by synchronization are said to be a data race if at least one access is a write. Data races cause shared memory parallel programs to behave unpredictably and are typically considered a bug. It is hard to manually identify memory access instructions causing data races in large …

    rice Repository record for Dynamic data race detection for OpenMP programs (opens in a new tab)

  3. Dynamic Data Race Detection for Structured Parallelism

    … guarantees such as deadlock-freedom. However, data races remain a challenging source of bugs in parallel programs. Data races may occur only in few of the possible schedules of a parallel program, thereby making them extremely hard to detect, reproduce, and correct. In the past, dynamic data …

    rice Repository record for Dynamic Data Race Detection for Structured Parallelism (opens in a new tab)

  4. Data Race Detection for Event-Driven Parallel Runtime Systems

    … to focus on program logic, such as control and data dependences, thereby enabling portability across a wide range of platforms and system configurations. However, the applications written on top of EDP runtimes remain vulnerable to data races. Existing data race detection tools either do not …

    rice Repository record for Data Race Detection for Event-Driven Parallel Runtime Systems (opens in a new tab)

  5. Fast and Precise On-The-Fly Data Race Detection

    … Although developers have a wide choice of race detection tools available, we have found that the majority of these techniques do not scale well and developers are often forced to balance precision with speed. Additionally, various practical issues force even precise race detectors to …

    tamu Repository record for Fast and Precise On-The-Fly Data Race Detection (opens in a new tab)

  6. Efficient Precise Dynamic Data Race Detection For Cpu And Gpu

    Data races are notorious bugs. They introduce non-determinism in programs behavior, complicate programs semantics, making it challenging to debug parallel programs. To make parallel programming easier, efficient data race detection has been a research topic in the last decades. However, existing …

    penn Repository record for Efficient Precise Dynamic Data Race Detection For Cpu And Gpu (opens in a new tab)

  7. Accurate and efficient on-the-fly data race detection for multithreaded programs

    … behavior. One of such defects is known as data race. Programs which have data races often results in inconsistent data and unpredictable behavior. Conventional hybrid approaches of detecting data races suffer from either excessive analysis overhead or precision loss. In this thesis, we …

    unsw Repository record for Accurate and efficient on-the-fly data race detection for multithreaded programs (opens in a new tab)

  8. Interference-Free Regions and Their Application to Compiler Optimization and Data-Race Detection

    … for C++ effectively requires programs to be "data-race-free": all executions of the program must have the property that any conflicting memory accesses in different threads are ordered by synchronization. To meet this requirement, programmers must ensure that threads properly coordinate …

    washington Repository record for Interference-Free Regions and Their Application to Compiler Optimization and Data-Race Detection (opens in a new tab)

  9. ZipperOTF: Automatic, Precise, and Simple Data Race Detection for Task Parallel Programs with Mutual Exclusion

    Data race in parallel programs can be difficult to precisely detect, and doing so manually can often prove unsuccessful. Task parallel programming models can help reduce defects introduced by the programmer by restricting concurrent functionalities to fork-join operations. Typical data race …

    byu Repository record for ZipperOTF: Automatic, Precise, and Simple Data Race Detection for Task Parallel Programs with Mutual Exclusion (opens in a new tab) Download PDF for ZipperOTF: Automatic, Precise, and Simple Data Race Detection for Task Parallel Programs with Mutual Exclusion (opens in a new tab)

  10. Software and Hardware Support for Data-Race Exceptions

    Some researchers have proposed data-race exceptions to mitigate the ill effects of data races in shared-memory multithreaded programs. Data-race exceptions make every data race an explicit fail-stop error at run-time. Implementing data-race exceptions naturally requires accurate dynamic data-race …

    washington Repository record for Software and Hardware Support for Data-Race Exceptions (opens in a new tab)

  11. Verification of Task Parallel Programs Using Predictive Analysis

    … if at least one of the accesses is for writing, data race is observed in the program. Data races can introduce non-determinism in the program output making it important to have data race detection tools. To detect data races in task parallel programs, a new Sound and Complete technique based on …

    byu Repository record for Verification of Task Parallel Programs Using Predictive Analysis (opens in a new tab) Download PDF for Verification of Task Parallel Programs Using Predictive Analysis (opens in a new tab)

  12. Enhanced Debugging of Data Races in Parallel Programs Using OpenMP

    … (i.e. deadlock, livelock, priority inversion, race conditions). Data races, one type of race condition, are the most common software fault in shared-memory programs, and can be difficult to find because they are nondeterministic. Current data-race detection tools are often plagued by numerous …

    houston Repository record for Enhanced Debugging of Data Races in Parallel Programs Using OpenMP (opens in a new tab)

  13. Enhancing GPU programmability and correctness through transactional execution

    … scientific communities, but also as integrated data-parallel accelerators on existing multicore processors. Support for massive fine-grained parallelism in contemporary GPUs provides a tremendous amount of computing power. GPUs support thousands of lightweight threads to deliver high …

    umn Repository record for Enhancing GPU programmability and correctness through transactional execution (opens in a new tab)

  14. Slot-based Calling Context Encoding

    … can also enhance some dynamic analysis such as data race detection. To obtain the calling context at runtime, current approaches either perform expensive stack walking to recover contexts or instrument the application and dynamically encode the context into an integer. The current encoding …

    ut-knoxville Repository record for Slot-based Calling Context Encoding (opens in a new tab)

  15. Faster and More Precise Pointer Analysis Algorithms for Automatic Bug Detection

    … applications, such as value-flow analysis, bug detection, etc. It is also a prerequisite of many compiler optimizations. However, despite decades of research, the scalability and precision of pointer analysis remain to be an open question. In this dissertation, I introduce my research effort to …

    tamu Repository record for Faster and More Precise Pointer Analysis Algorithms for Automatic Bug Detection (opens in a new tab)

  16. Techniques to detect and avert advanced software concurrency bugs

    … be benign or non-existent. For example, lots of data races detected by a race detection tool could be relatively benign data races. Also, many dynamic software analyses cause orders-ofmagnitude slowdowns, which users cannot tolerate at runtime. This dissertation contains three parts. The first …

    uiuc Repository record for Techniques to detect and avert advanced software concurrency bugs (opens in a new tab)

  17. Improving The Scalability Of Directed Model Checking Of Concurrent Java Code Through Hybrid And Distributed Analysis

    … of shared resources. These include deadlocks, race conditions, and atomicity violations. Model checking has proven to be a powerful and versatile approach to the task. The model-checking problem can be summarized as such: given a state-transition graph of a system and a specification, prove …

    uab Repository record for Improving The Scalability Of Directed Model Checking Of Concurrent Java Code Through Hybrid And Distributed Analysis (opens in a new tab)

  18. Performance-correctness challenges in emerging heterogeneous multicore processors

    … of parallelism. Concurrency bugs, such as data race conditions, are severe impediments to the effectiveness of parallel computing. Although, several techniques have been proposed to identify and rectify data race conditions, their implementation faces several challenges. While …

    umn Repository record for Performance-correctness challenges in emerging heterogeneous multicore processors (opens in a new tab)

  19. Continuous Reasoning of Large Complex Software via Incremental Analysis

    … framework to detect concurrency bugs (i.e., data race and deadlock) during development phase. Except for IPA, D4 is powered by another three incremental algorithms of static happens-before analysis, lock-dependency analysis and static concurrency bug detection. D4 can pinpoint concurrency …

    tamu Repository record for Continuous Reasoning of Large Complex Software via Incremental Analysis (opens in a new tab)

  20. Continuous Reasoning of Large Complex Software via Incremental Analysis

    … framework to detect concurrency bugs (i.e., data race and deadlock) during development phase. Except for IPA, D4 is powered by another three incremental algorithms of static happens-before analysis, lock-dependency analysis and static concurrency bug detection. D4 can pinpoint concurrency …

    tamu Repository record for Continuous Reasoning of Large Complex Software via Incremental Analysis (opens in a new tab)

Page 1 of 2