Advances in Programming Languages 2018/19 Lecture 11: Cautionary Tales in Concurrency

This lecture concluded the set on concurrency with three distinctive challenges for concurrent programming and some possible solutions: lock networks, deadlock, and hand-over-hand locking; priority inversion in thread scheduling; and the relaxed memory models used in current processor architectures.

Media Hopper Create does not permit public attachments to videos, so for the corresponding slides you will need to use this alternate server: https://wp.inf.ed.ac.uk/apl18/wp-content/uploads/sites/10/2018/10/apl18-11.pdf