Provably and Practically Efficient Race Detection for Task-Parallel Code

by Xu, Yifan

Type Thesis
Rate 0.0 /5

Parallel systems are pervasive nowadays. Specifically, modern computers have embraced multicore architectures due to the difficulties of exploiting higher clock speeds on single-core CPUs. However, parallel programming is challenging. Determinacy race, in particular, is a common pitfall when writing task-parallel code. It can easily lead to non-deterministic behavior of the parallel program and therefore a determinacy race is often considered as a bug. Unfortunately, such bugs are hard to debug…

Read More ↓
Details
Files
Reviews
Download

Summary

Parallel systems are pervasive nowadays. Specifically, modern computers have embraced multicore architectures due to the difficulties of exploiting higher clock speeds on single-core CPUs. However, parallel programming is challenging. Determinacy race, in particular, is a common pitfall when writing task-parallel code. It can easily lead to non-deterministic behavior of the parallel program and therefore a determinacy race is often considered as a bug. Unfortunately, such bugs are hard to debug because they do not necessarily produce obvious failures in every single execution.

Read More ↓

Edition Statements

  • Publication Date:2021

Thesis Information

  • Degree:Ph.D.
  • University:Washington University in St. Louis
  • Advisor/Supervisor:Lee, I-Ting Angelina
  • Pages:185

Publication Statements

  • Language:eng
  • Publication Date:2021

Edition Identifiers

  • proquest:2578166132

Subjects

Computer engineering Computer Science Determinacy race eng future PDF Pipeline Race detection reachability analysis Runtime system

Writers

Xu, Yifan Lee, I-Ting Angelina

Rate & Review

0.0/5
(0 people Voted)

No reviews yet. Be the first to rate this work.

Files & Downloads

Log in to request a copy