Detecting and Surviving Data Races Using Complementary Schedules

Data races are a common source of errors in multithreaded programs. In this paper, the authors show how to protect a program from data race errors at runtime by executing multiple replicas of the program with complementary thread schedules. Complementary schedules are a set of replica thread schedules crafted to ensure that replicas diverge only if a data race occurs and to make it very likely that harmful data races cause divergences. Their system, called Frost1, uses complementary schedules to cause at least one replica to avoid the order of racing instructions that leads to incorrect program execution for most harmful data races. Frost introduces outcome-based race detection, which detects data races by comparing the state of replicas executing complementary schedules.
Provided by: University of Michigan Topic: Software Date Added: Sep 2011 Format: PDF

Find By Topic