Concurrency, 2 of 3

This video is from Southwestern University. It discusses the basic idea of "deadlock" via a classic thought-problem called the Dining Philosophers problem.

All videos in this unit:

• Concurrency #1 (not required)
• Concurrency #2   ← you are here
• Concurrency #3 (watch by August 2)

All units (so far):

• The unix command line (watch by May 17)
• Software tools (watch by May 17)
• Shell programming (watch most in the week of May 17; one more by July 26)
• The make command
• Introductory C (watch by May 31)
• Introduction to arrays in C (watch by May 31)
• Pointers in C (watch by June 7)
• Files in C (watch by June 14)
• Strings in C (watch by June 14)
• struct (watch by June 7)
• The C declaration syntax (watch by July 5)
• The C pre-processor (watch by July 19)
• Dynamic memory allocation (malloc()) (watch by July 5)
• The unix filesystem (watch by July 5)
• Processes (watch most by July 5)
• Signals (watch by July 12)
• Bitwise operations in C (watch by July 12)
• sockets (optionally watch in August)
• select() (watch by July 19)
• Concurrency   ← you are here

Overall course schedule:

• Course schedule