Lecture Summaries

Not intended to be a detailed transcript of each class meeting, but rather a brief description and possibly some pointers to sources.


Coverage of Chapter 7 begins. Notes are cuts0.pdf. A related algorithm, if time permits, is Lamport's distributed mutual exclusion algorithm.


Finish Chapter 3 with impos0.pdf. Questions about current homework? Moving on next to Chapter 7 of Distributed Algorithm book.


The class meeting starts with another TLC demonstration (notes intlc2.pdf) which shows how to deal with n-process mutual exclusion (some new TLA notation is used). Then the algorithms from Chapter 3 of the Distributed Algorithm book.


Start Chapter 2 from Distributed Algorithm book, also selected topics from Chapter 4 of TLA book: logic3.pdf. Also, a quick derivation of one question's answer in the exam: dual.pdf


First Exam. Then a demonstration of TCL, transcript in tlc1.pdf


Covering Chapter 3 of the TLA book. See notes in logic2.pdf.


Continue with the notes logic0.pdf. Covered part of TLA introduction, in notes logic1.pdf.


The topic for the next several class meeting is TLA+. This Tuesday meeting begins with a review of logic, then a quick look at predicate logic and temporal logic. Here are logic0.pdf some notes.


Class meeting introduced the problem of mutual exclusion, based on these notes. Also, each student invited to email office hours preference to instructor.


Syllabus and general description of the situation in distributed computing. Some sources (textbooks, notes, papers). Mention of some topics. The course will provide background on research in an active topic, namely (theory of) distributed systems. Some topics even generate debate.

Lectures (last edited 2017-09-21 13:49:20 by Ted Herman)