I-Ting Angelina Lee
Washington University in St. Louis
December 11, 2017
11:00am - 12:00pm
Donald Bren Hall 6011
In this talk, I will present a race-detection algorithm, 2D-Order, for detecting races in a more general class of programs, namely programs whose dependence structure can be represented as planar dags embedded in 2-dimensional grids. Such dependence structures arise from programs that use pipelined parallelism or dynamic programming recurrences. Given a computation with work W and span S, 2D-Order executes the computation while also detecting races in O(W/P + S) time on P processors, which is asymptotically optimal.
We also implemented P-Racer, a race-detection tool based on 2D-Order for Cilk-P, which is a language for expressing pipeline parallelism. Empirical results demonstrate that P-Racer incurs reasonable overhead and exhibits scalability similar to the baseline (executions without race detection) when running on multiple cores.
Dr. Lee's research focuses on advancing software technologies for parallel computing. She is interested in many aspects of parallel computing, including designing programming models and linguistic constructs to simplify parallel programming, developing runtime and operating system support to execute multithreaded programs efficiently, and building software tools to aid debugging and performance engineering of multithreaded code.