Overview of the Lectures

We will try to have the lecture notes available on-line before the lecture so you can bring them to the lecture to do notes and (in case of errors) corrections. Last year's lectures can be found on last year's web-page but changes and updates will be done this year.

• Introduction to the course. The goal of the course. Course Materials. The basic concepts of parallelism and concurrency.
  Slides for viewing on screen
  Code examples from the lecture.
• The shared update problem; Peterson's algorithm. Introduction to semaphores and locks.
  Book chapter 3, and start of chapter 4.
  Slides for viewing on screen.
  Code examples from the lecture.
• Semaphores; dining philosophers and Producer-consumers/buffers.
  Book chapter 4.
  Slides for viewing on screen
  Code examples from the lecture.
• Monitors.
  Book chapter 5.
  Slides for viewing on screen
  Code examples from the lecture.
• Monitors continued.
  Book chapter 5.
  Slides for viewing on screen
  
• Introduction to Message Passing.
  Book chapter 7.
  Slides for viewing on screen
  Code examples from the lecture.
  
• Message Passing continued. Rendezvous and the input statement.
  Book chapter 8.
  Slides for viewing on screen
  Code examples from the lecture.
• Part I: Linda. Part II: Introduction to Erlang.
  Book chapter 7.7
  Slides for viewing on screen
  Code examples from the lecture.
• Guest lecture by Andras Vajda from Ericsson Software Research.
  
• Erlang, continued.
  Slides for viewing on screen, and
• Reasonning about concurrent programs.
  Book chapter 2.6. Chapter 4.1-4.6 in Principles of Concurrent and Distributed Programming
  Slides for viewing on screen
• Transactional Memory
  Slides for viewing on screen
• Course Summary. Exam Info.
  Slides for viewing on screen
  Code examples from the lecture.
• Monitors continued.
  Book chapter 5.
  Slides for viewing on screen