Tolerating asymmetric data races with minimal hardware support
Qi, Shanxiang
Loading…
Permalink
https://hdl.handle.net/2142/15995
Description
Title
Tolerating asymmetric data races with minimal hardware support
Author(s)
Qi, Shanxiang
Issue Date
2010-05-18T18:55:33Z
Director of Research (if dissertation) or Advisor (if thesis)
Torrellas, Josep
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
M.S.
Degree Level
Thesis
Keyword(s)
computer architecture
software reliability
concurrency bugs
Abstract
Data races are a common type of concurrency bug in parallel programs. An important type of race that
has not received much attention is Asymmetric data races. In these races, the state of well tested, correct
threads is corrupted by racing threads from external, typically third-party code. Current schemes to detect
and tolerate these races are software based, and have substantial execution overhead.
This thesis proposes the first scheme to detect and tolerate asymmetric data races in hardware. The
approach, called Pacman, induces negligible execution overhead and requires minimal hardware modifications.
In addition, compared to past software-based schemes, Pacman eliminates deadlock cases. Pacman is
based on using hardware address signatures to detect the asymmetric races. Processor, cache coherence, and
protocol messages remain unchanged. We evaluate Pacman for all the SPLASH2 and PARSEC applications.
Our results show that Pacman is effective and has minimal overhead.
ii
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
