Files in this item



application/pdfQi_Shanxiang.pdf (951kB)
(no description provided)PDF


Title:Tolerating asymmetric data races with minimal hardware support
Author(s):Qi, Shanxiang
Advisor(s):Torrellas, Josep
Department / Program:Computer Science
Discipline:Computer Science
Degree Granting Institution:University of Illinois at Urbana-Champaign
Subject(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
Issue Date:2010-05-18
Rights Information:Copyright 2010 Shanxiang Qi
Date Available in IDEALS:2010-05-18
Date Deposited:May 2010

This item appears in the following Collection(s)

Item Statistics