417 Lecture material

CS 417 CS 417 course page News About the course Prerequisites Things you need Policy Syllabus Documents Homework Exam info Check your grades		Previous Lecture Next Lecture Lecture 5.5: Distributed deadlocks Recitation notes: Distributed Deadlocks Distributed Deadlocks - paper rather than slide format Supplemental notes: Buzzwords: conditions for deadlock, resource utilization graph, cyclical dependencies, communication deadlock, resource deadlock, detection, prevention, avoidance, centralized algorithm for deadlock detection, false deadlock, Chandy-Misra-Haas, distributed detection algorithm, probing, probe messages, deadlock prevention via wait-die algorithm, deadlock prevention via wound-wait algorithm
		Back to syllabus

Back to Paul at Rutgers.

Paul Krzyzanowski, pxk@cs.rutgers.edu