Message Area

 

Distributed Systems

CSE 4/586

[[Announcements]]\n[[Syllabus]]\n

[[Syllabus]] [[Course Material]] [[Assignments]] [[Announcements]]

[[Assignment1|CSE586/hw1.pdf]]

T/R 2:00pm-3:20pm at 14 Knox.\noffice hours: W 3pm-5pm\n[[download syllabus as pdf|CSE586/syllabus.pdf]]\n----\nThis course introduces concepts and mechanisms in the design and analysis of distributed programs, including programming logics for distributed programs, global time and global state, distributed algorithms for consensus and coordination, problems in fault-tolerant distribution, distributed data structures, and representative distributed computing environments.\n\n!!Topics\n# Introduction, Predicate calculus\n# Syntax and semantics for distributed programs, temporal logic\n# Safety and progress properties, proof of program properties\n# Examples on reasoning about programs\n# Time: logical clocks, vector clocks, clock synchronization\n# State: consistent states, distributed snapshots, stability detection\n# Mutual exclusion, Dining philosophers\n# Consensus, Leader election\n# Fault-tolerant agreement, Byzantine agreement\n# Self-stabilization\n# Examples of self-stabilizing algorithms\n# Systems design primitives: shared memory, message passing, overlays\n# Representative distributed computing environments\n\n!! Grading\n* %40 Assignments (expect 8-10 assignments, no late homeworks!) \n* %30 Midterm (closed book)\n* %30 Final (closed book, final will be inclusive of the\n midterm content)\n\n!!TAs\n# Murat Ali Bayir, office hours: Th 4:00-5:30, 329 Bell\n# Yang Wang, office hours: M 3:30-5:30, 329 Bell\n

* Reading for first week is Chapter 1.\n* Reading for second week is Chapters 2 and 3.\n* [[Assignment1|CSE586/hw1.pdf]] is due on Tuesday, Jan 27 in the class. (If you use truth tables you will be given half the points for the question. Please use the proof format we studied in the class.)\n* Recitation on Mon, Jan 19 is rescheduled --due to holiday-- to 5pm Tuesday at Bell 224.\n* [[Assignment2|CSE586/hw2.pdf]] is due on Tuesday, Feb 3 in the class. \n* [[Assignment3|CSE586/hw3.pdf]] is due on Tuesday, Feb 10 in the class. \n* Reading for fifth week is Chapter 5. \n* Reading for sixth week is Chapters 9 and 10.\n* [[Solutions for hw1|CSE586/hw1sol.pdf]] is available.\n* [[Solutions for hw3|CSE586/hw3sol.pdf]] is available. \n* Reading for seventh week is Chapters 7 and 8.\n* [[Assignment4|CSE586/hw4.pdf]] is due on Tuesday, Feb 24 in the class.\n* [[Solutions for hw2|CSE586/hw2sol.pdf]] is available. \n* [[Solutions for hw4|CSE586/hw4sol1.jpg]], [[page2|CSE586/hw4sol2.jpg]] are available. \n

The reference textbook for the course is available as a pdf download:\n[[Paolo Sivilotti, Introduction to Distributed Systems, 2005|CSE586/book.pdf]]\n----\n[[Introduction|CSE586/intro.pdf]]\nRead Chapter 1 from the book.\n[[additional reference for week 1|CSE586/logicHandout.pdf]]\n[[Cheatsheet for propositional logic|CSE586/cheatsheetPropositionalLogic.pdf]]\n----\nRead Chapter 2,3 from the book.\n[[Coffee bean problem|CSE586/can.pdf]]\n[[handout for program correctness|CSE586/correctness.pdf]] (courtesy of Anish Arora)\n----\nRead Chapter 9, 10 from the book.\n[[Notes on global snapshot from Anish Arora|CSE586/snapshot.pdf]]\n----\n[[Notes on leader election and fault-tolerance from Anish Arora|CSE586/ft.pdf]]\n----\n[[Paxos presentation|CSE586/paxos.ppt]]\n----\n[[Notes on faults and fault-tolerance|CSE586/faults-spec.pdf]]\n----\n[[Stabilizing tree protocol|CSE586/stabtree.pdf]]

!! Final is on Tuesday, May 5 !\n* [[Solutions for the final|CSE586/finalsol.pdf]] is available. \n* [[Assignment7|CSE586/hw7.pdf]] is due on Tuesday, May 5 in the class. \n* See Course material for links to some of the last lectures.\n* [[Solutions for hw6|CSE586/hw6sol.pdf]] is available. \n* [[Solutions for hw5|CSE586/hw5sol.pdf]] is available. \n* [[Assignment6|CSE586/hw6.pdf]] is due on Thursday, Apr 23 in the class.\n* [[Assignment5|CSE586/hw5.pdf]] is due on Thursday, Apr 23 in the class.\n\nHere are the OldAnnouncements.\n