Go upUp to Theodore Norvell's Courses page

Engr 8893 Concurrent Programming / 9869 Advanced Concurrent Programming. Notes and Slides.

Home
Notes and Slide
Examples
Related Links
Websubmit

These are also available on UNIX at ~theo/pub/cp and on the windows network at L:\courses\8893

Reading

Exams and quizzes

None yet

Assignments and solutions

Class notes

Supplementary Notes

Proof Outline Logic

Part 0 Introduction

Part 1 Shared Variable Programming

  • Slide set 2a Processes and properties. Hoare Logic and Proof Outline Logic for sequential programs
    • Correction: Jan 23. Expanded page 3 (now pages 3 and 4).
    • Correction: Jan 30. Page 10 (formerly page 9). In the first example on the page "W(x)12" should be "W(x)4" in two places.
  • Slide set 2b Proof Outline Logic for concurrent programs
    • Correction: Jan 25. On page 27 on the right-hand side only, changed"c0 ≤ c1" to "c1 ≤ c0" . Also changed "R2" to "R1".
  • Slide set 3a Mutual exclusion and Petersen's algorithm.
  • Slide set 3b Barrier synchronization and flag synchronization.
  • Slide set 4. Semaphores
    • Correction: Feb 04. On page 2, "0 ≤ #in = s-1 ≤ 1" should be "0 ≤ #in = 1-s ≤ 1"
    • Changes: Feb 06. I made several minor changes to pages 27--31 to improve consistancy.
  • Slide set 5. Monitors

Part 2. Distributed Programming

Part 3 Further topics

  • Transactional memory
    • Addition. April 1st. Added notes pages 14 and 15 on isolation.

  • Slides below this line are from 2008 and have not been updated yet.


  • Model Checking
  • Scientific Computing
  • Real-time Computing
  • Summary

This page was generated by PerlInHTML.