Distribuerade system fk.
2020, LP3 – 7.5 hec (hp)
TDA297 (CTH), DIT290 (GU)
NEW: Information on distance examination
Please check the following Canvas page for information regarding the Home Exam on Wednesday.
Course Examiner and responsible for the course:
Philippas Tsigas, tsigas [at] chalmers [dot] se
- Dimitrios Palyvos-Giannas [Homework Assignment and Lab2], palyvos [at] chalmers [dot] se
- Hannaneh Najdataei [Lab 1], hannajd [at] chalmers [dot] se
- Seyed Reza Esmaeili [Homework Assignment and Lab2], seyedr [at] student.chalmers [dot] se
TAs office hours for assistance on the assignments:
Every group has to (MANDATORY) book a slot for Lab 1 from the provided times in the course calendar. Only one group can pick the same time slot as there will be one TA available.
Apart from the mandatory visits, you can visit TAs in the weeks:
Mondays 15:00 - 16:00, room 5128 or as redirected from there.
Mondays 10:00-11:45, EL42 (from Monday, Jan 20st)
Wednesdays 13:15-15:00, EL42
Thursday 08:00-9:45, EL43
The course starts on Monday, January 20th.
See also the Course Schedule. Note that it might be subject to changes during the course so check it regularly.
All programming assignments are to be done in groups of 2.
- 1st Assignment is due 23rd of February 2020
- A small programming assignment in Data Stream Processing is due 13th of March 2020
The homework assignment is to be done in groups of 2. There are multiple deadlines for this assignment and the first one (paper selection) is due 9th of February 2020. More information here.
We will use the Fifth Edition of the book titled "Distributed Systems: Concepts and Design" written by: George Coulouris, Jean Dollimore, Tim Kindberg and Gordon Blair, and published by Addison-Wesley, ISBN-10: 0132143011, ISBN-13: 9780132143011. 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.
For the exam you have to study:
- Chapters: 15, 17, 18 5th edition of the Coulouris et al. book. If you have not studied "Transactions and Concurrency Control" before study chapter 16th also.
- Chapter 1, 3 and 5 of the Master's Thesis.
Marc Shapiro, Nuno Pregui¸ca, Carlos Baquero, Marek Zawirski. Conflict-free Replicated Data Types. [Research Report] RR-7687, 2011, (https://hal.inria.fr/inria-00609399v1/document).
- A set of fast links to papers referenced by the thesis for fast access:
- Dijkstra, E. W. (1971, June). Hierarchical ordering of sequential processes. Acta Informatica 1(2): 115-138. (The historical paper that introduces many concepts on process synchronization that we use every day. You might want to read in the original as first introduced in 1971).
- Chandy, K.M.; Misra, J. (1984). The Drinking Philosophers Problem. ACM Transactions on Programming Languages and Systems. (The drinking philosophers problem and a solution for it based on dynamic distributed DAG manipulation.)
- Nancy A. Lynch Upper bounds for static resource allocation in a distributed system Journal for Computer and System Sciences, 23:254-278, 1981. (Bounds and techniques for bounds for resource allocation).
- Manhoi Choy and Ambuj K. Singh. Efficient fault-tolerant algorithms for distributed resource allocation. ACM Transactions on Programming Languages and Systems, 17(3):535-559, May 1995. (The papers that introduce the use of Doorways for resource allocation.)
- Ernest Chang; Rosemary Roberts (1979), An improved algorithm for decentralized extrema-finding in circular configurations of processes, Communications of the ACM (ACM) 22 (5): 281–283 (for leader election on rings, a classical paper for rings).
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:
- 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).
- 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.
- 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.
- Resource allocation.
- Analysis and Design of Distributed Algorithms
- Data Streaming
A team of students representing the GU-CS students, the CTH International Master's program students, and the "local" CTH students is 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.
The team is initially comprised of the following students (If you want to join lets us know. The list will be finalized during the first week of the course):
The syllabus page shows a table-oriented view of course schedule and basics of course grading. You can add any other comments, notes or thoughts you have about the course structure, course policies or anything else.
To add some comments, click the 'Edit' link at the top.