MIT

Lecture 17: Synchronization Without Locks

Systems ThinkingData Science, Analytics & Computer TechnologySoftware Design and EngineeringAlgorithms and Data StructuresComputer ScienceBusiness & Management

Om kurset

Description: Prof. Leiserson discusses non-lock synchronization using memory models, Peterson’s algorithm, instruction reordering, and hardware reordering. He discusses the compare-and-swap operation; lock-free stacks, pushes, and pops; and the ABA problem. Instructor: Charles Leiserson