Concurrent Programming: Theory to Practice

This lecture covers the transition from theoretical design to practical implementation in concurrent programming, focusing on upper/lower bounds, system models, correctness proofs, and practicality issues. It delves into CPU caches, cache coherence, and graph processing using concurrent data structures. The instructor discusses the importance of caching, typical server configurations, and the effects of false sharing. The lecture also explores cache coherence mechanisms like MESI, scalability goals, and the challenges of scalability. Various experiments and code snippets are presented to illustrate the concepts discussed.