Title: SRCU: a case study in memory ordering Description: Memory ordering guarantees are the backbone of SRCU, an important RCU synchronization mechanism in the kernel. Can we use the Linux kernel memory model to understand complex concurrent code better? In this talk, we will go over: - SRCU internals overview and why it works - Discuss in detail, all the 8 or so memory barriers in SRCU and why they are needed. - Comparable access patterns to each barrier (LB, MP etc) - Linux kernel memory model (LKMM) experiments on studying effects of each memory barrier, along with execution candidate graphs generated by herd7. - Possible formal methods / models. - Discuss both correctness and forward progress issues tackled by these memory barriers. (Resending as my previous email got messed up by mail client, thanks). - Joel
