Computer Science Thesis Proposal

Thursday, December 10, 2015 - 2:00pm


Traffic 21 Classroom 6501 Gates & Hillman Centers



The Relaxed Memory Calculus (RMC) is a novel approach for portable low-level concurrent programming in the presence of the the relaxed memory behavior caused by modern hardware architectures and optimizing compilers. RMC takes a declarative approach to programming with relaxed memory: programmers explicitly specify constraints on execution order and on the visibility of writes. This differs from other low-level programming language memory models, which---when they exist---are usually based on ordering annotations attached to synchronization operations and/or explicit memory barriers. In this proposal, we suggest that this declarative approach based on explicit programmer-specified constraints is a practical approach for implementing low-level concurrent algorithms. We attempt to establish the plausibility of this thesis by giving a description of programming in C++ using RMC and describing the implementation of a compiler for RMC. The proposed work, then, consists of efficiency-driven improvements to the RMC semantics and compiler and an evaluation of the approach based on case studies. Thesis Committee: Karl Crary (Chair)Kayvon Fatahalian Todd Mowry Paul McKenney (IBM) Copy of Thesis Summary

For More Information, Contact:


Thesis Proposal