Distributed Systems II
Distribuerade system fk.

2012, LP3 – 7.5 hec (hp)
TDA297 (CTH), DIT290 (GU)

Chalmers University of Technology and Gothenburg University

News:

16 April 2012:
The review of exams (granskning) is going to take place on 27 April 2012 14:00-15:00, at EDIT 6128 Grouproom.

21 March 2012:
The final deadline for submitting the Labs is Wednesday the 28th of March.
If you miss this deadline, you can still submit the assignments but they will be checked in August after the re-exam.

2 March 2012: The slides for Lectures 13 and 14 are available now.

28 February 2012: The slides for Lecture 12 are available now.

24 February 2012: The slides for Lecture 11 are available now.

20 February 2012: The slides for Assignment Lecture 4 are available now. The page for Lab 3 is also updated.

17 February 2012: The slides for Lecture 10 are available now.

15 February 2012: The slides for Lecture 9 are available now.

13 February 2012:
Yiannis has office hours for questions regarding the assignments in room 5107 at 15:00-16:00 on Thursday February 16.
The slides for Lecture 8 are available now.
Extra Question on "Byzantine Faults on Quorum Systems" is now available in the Examination section. Deadline: 20th of February.

10 February 2012: The slides from the Q&A Assignment lecture are available: pptx, pdf.

9 February 2012: The schedule for the course is now updated.

8 February 2012: The slides for Lecture 7 are available now.

3 February 2012: The slides for Lecture 6 are available now.

30 January 2012: The page for Lab 2 is updated.

27 January 2012: The slides for Lecture 5 are available now.

25 January 2012:
Yiannis has office hours for questions regarding the assignments in room 5107 at 15:00-17:00 on Tuesday January 31.
The slides for Lecture 4 are available now.
Now you can register for the labs at: https://fire.cs.chalmers.se:8039/cgi/Fire-ds2.
An extra reading material on Byzantine Agreement is available now.

23 January 2012: The page for Lab 1 is updated.

21 January 2012: The slides for Lecture 3 are updated.

18 January 2012: The slides for Lecture 1 and Lecture 2 are updated.

Course Examiner and responsible for the course:
Philippas Tsigas   tsigas [at] chalmers [dot] se

Course Assistants:
Farnaz Moradi  moradi [at] chalmers [dot] se
Yiannis Nikolakopoulos  ioaniko [at] chalmers [dot] se

Course hours/place:
Mondays 10-12, EL42
Wednesdays 13-15, EL43
Fridays 13-15, EL43

See also Course schedule below. Note that it might be subject to changes during the course so check it regularly.

Examination:
Monday the 5th of March 2012 in the V building 14:00-18:00

Extra Question on Byzantine Faults on Quorum Systems: pdf

Rexamination:
Tuesday the 28th of August 2012 in the M building 8:30-12:30

Programming assignments:
All programming assignments is to be done in groups of 2.

Office hours: Yiannis has office hours for questions in room 5107 at 15:00-17:00 on Tuesday January 31 and 15:00-16:00 on Thursday February 16.
Other meetings can be arranged on-line, via e-mail.

If you cannot find a lab partner, use this doodle to either:

If the numbers turn out odd in the end contact Farnaz about forming one group of three.

Literature:
We will use the Fourth Edition of the book titled "Distributed Systems: Concepts and Design" written by: George Coulouris, Jean Dollimore and Tim Kindberg, and published by Addison-Wesley, ISBN-10: 0321263545, ISBN-13: 978-0321263544. For special themes we will use additional literature items (scientific papers), which will be specified/distributed during the course and, whenever possible, will be made available via the webpage of the course

Course Schedule: Tentative - Please make sure that you "reload" this page to get current info

Week (Chalmers week/LV)

Monday

Wednesday

Friday

3 (1)
(Jan 16-20)

Lecture 1:
Introduction

Room: EL42

Lecture 2:
Broadcasting

Room: EL43

Lecture 3
Fault-tolerant Agreement

Room: EL43

4 (2)
(Jan 23-Jan 27)

Assignment Lecture 1:
Introduction to Lab 1

Room: EL42

Lecture 4:
Fault-tolerant Agreement (cont.)

Room: EL43

Lecture 5:
Replication & Quorum Consensus

Room: EL43

5 (3)
(Jan 30-Feb 3)

Assignment Lecture 2:
Introduction to Lab 2 + Questions and answers for all labs.

Room: EL42


No Lecture – Work on assignments

Lecture 6:
Replication (cont.)

Room: EL43

6 (4)
(Feb 6-10)

Lecture 7:
Distributed Transactions & Concurrency Control in Distributed Transactions

Room: EL42

Deadline for lab 1 at 23:59


CHARM – No Lecture

Assignment Lecture 3:
Questions and answers for all labs.

Room: EL43

7 (5)
(Feb 13-17)

Lecture 8:
Distributed Algorithms

Room: EL42

Notification date for lab 1

Lecture 9:
Distributed Algorithms (cont.)

Room: EL43

Lecture 10:
Mutual Exclusion and Resource Allocation. Dining Philosophers

Room: EL43

8 (6)
(Feb 20-24)

Assignment Lecture 4:
Sensor networks + Introduction to Lab 3 + Questions and answers for all labs.

Room: EL42

Deadline for lab 2 at 23:59

Lecture 11:
Drinking Philoshophers

Room: EL43

Assignment Lecture 5:
Questions and answers for all labs.

Room: EL43

9 (7)
(Feb 27-Mar 3)

Lecture 12:
Drinking Philosophers and Efficient Resource Allocation

Room: EL42

Lecture 13:
Efficient Resource Allocation (cont.)

Room: EL43

Lecture 14:
Closing remarks + Questions and Answers.

Room: EL43

EXAM: Monday the 5th of March 2012 in the V building 14:00-18:00

Slides:

Lecture 1: Introduction. Slides: pptx, pdf

Lecture 2: Fault-Tolerant Broadcasting. Slides: ppt, pdf

Lecture 3: Fault-tolerant Agreement. Slides: ppt, pdf. Extra readind material: pdf

Lecture 4: Fault-tolerant Agreement (cont.). Slides: ppt, pdf

Lecture 5: Replication. Slides: pptx, pdf

Lecture 6: Replication (cont.). Slides: pptx, pdf

Lecture 7: Replication (cont.). Slides: pptx, pdf

Lecture 8: Distributed Algorithms. Slides: pdf

Lecture 9: Distributed Algorithms (cont.). Slides: pdf

Lecture 10: Mutual Exclusion and Resource Allocation. Dining Philosophers. Slides: pdf

Lecture 11: Drinking Philosophers. Slides: pdf

Lecture 12: Drinking Philosophers and Efficient Resource Allocation. Slides: pdf

Lecture 13: Efficient Resource Allocation (cont.). Slides: pptx, pdf

Lecture 14: Closing remarks. Slides: ppt, pdf


Assignment Lecture 4: Slides: Routing , Lab 3 (Part 1) , Lab 3 (Part 2)


For more slides from 2011, see the web page from 2011

Reading Material:

For the exam you have to study:

Past Exams

0008

0005

9905

9908

Course Description

Distributed systems is a popular and powerful computing paradigm. Their importance increases as networked computers become more common than free-standing ones, especially since many different types of computers can be found in networks.

In this course we will see the points of inherent difference and strength of distributed systems compared with sequential or strongly-coupled systems; consequently, we will also study the issues and problems that have to be addressed and solved efficiently for these differences to be taken advantage of, so that the system retains its strength and high potential.

In particular, we will address and study the following issues in distributed systems:
a) Synchronization: Continuation (after the course "Distributed Systems I") of the study of distributed clock-synchronization and its uses in mutual exclusion; study about resource allocation in general. Advance one step further, to see how to get solutions without the need for clock synchronization (and hence of lower cost in practice).
b) Replication: The advantages and costs of replicating data: the potential improvement in response times and reliability, and the extra communication costs involved in keeping data consistent.
c) Fault-tolerant Agreement in Distributed Systems: (a very special and significant problem, since it is a key issue in most synchronization and coordination problems in distributed systems) Study of the basic impossibility results and discuss their implications; proceed with solutions and protocols for systems with certain strengths and design structures.
d) Distributed Shared Memory: The difference between shared-memory-based programming and message-passing-based programming; types of consistency; write-update and write-invalidate protocols.
e) Resource allocation.

Course Evaluation

A team of at least three students representing the GU-CS students, the CTH International Master's program students and the "local" CTH students needs to be formed. The team's task is to:
- provide feedback from students
- take part in mid- and final-evaluation meetings
- write meeting minutes; and
- together with the teacher compile the final evaluation report.