In this talk I will present JudoSTM, a novel dynamic x86 binary-rewriting approach to implementing STM that supports C and C++ code and also atomic sections that contain arbitrary calls to shared-libraries. Furthermore, by using value-based conflict-detection JudoSTM additionally supports the transactional execution of both (i) irreversible system calls and (ii) library functions that may contain locks. We significantly lower overheads through several novel optimizations that improve the quality of rewritten x86 code and reduce the cost of conflict detection and write-buffering. We show that our approach performs comparably to Rochester's RSTM library-based implementation---demonstrating that a dynamic binary-rewriting approach to implementing STM is an interesting alternative.
Greg Steffan joined the University of Toronto as an Assistant Professor in the Department of Electrical and Computer Engineering in 2002. His area of expertise is in compilers and processor architecture, in particular methods of automatically exploiting parallelism in multicore processors and FPGAs. Greg completed his doctorate at Carnegie Mellon University in 2003, after undergraduate and Masters degrees at the University of Toronto in 1995 and 1997 respectively. He has also worked in the processor architecture research groups of MIPS Technologies and Compaq Computer Corporation (VSSAD).
Refreshments provided at 10:45 AM