//
This lecture explores non-lock synchronization methods, utilizing memory models, Peterson's algorithm, and instruction reordering. It covers the compare-and-swap operation, lock-free stacks, and the ABA problem.
MIT 6.172 Performance Engineering of Software Systems, Fall 2018
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.
