Pacman: Tolerating asymmetric data races with unintrusive hardware Conference Paper uri icon

abstract

  • Data races are a major contributor to parallel software unreliability. A type of race that is both common and typically harmful is the Asymmetric data race. It occurs when at least one of the racing threads is inside a critical section. Current proposals that target them are software-based. They slow down execution and require significant compiler, operating system (OS), or application changes. This paper proposes the first scheme to tolerate asymmetric data races in production runs with negligible execution overhead. The scheme, called Pacman, exploits cache coherence hardware to temporarily protect the variables that a thread accesses in a critical section from other threads' requests. Unlike previous schemes, Pacman induces negligible slowdown, needs no support from the compiler or (in the baseline design) from the OS, and requires no application source code changes. In addition, its hardware is relatively unintrusive. We test Pacman with the SPLASH-2, PARSEC, Sphinx 3, and Apache codes, and discover two unreported asymmetric data races. © 2012 IEEE.

name of conference

  • 2012 IEEE 18th International Symposium on High Performance Computer Architecture (HPCA)

published proceedings

  • IEEE International Symposium on High-Performance Comp Architecture

author list (cited authors)

  • Qi, S., Otsuki, N., Nogueira, L. O., Muzahid, A., & Torrellas, J

citation count

  • 14

complete list of authors

  • Qi, Shanxiang||Otsuki, Norimasa||Nogueira, Lois Orosa||Muzahid, Abdullah||Torrellas, Josep

publication date

  • February 2012

publisher