-Which degree programme is responsible for the course? Computer Science
-Which module does the course belong to? Computer science core
-Is the course available to students from other degree programmes? Yes
Students must have a Bachelors degree in computer science or related field.
More specifically students must have programming skills, knowledge about operating systems, networking and computer organisation/architectures including some basic understanding of concurrency issues in one computer.
Almost all other Master's degree courses will widen the basic understanding gained in this course, in particular courses in the Networking and Services study track.
During the course, students learn essential motivations, models and techniques for distribution of systems or services.
Key challenges discussed include
- management of shared global state and safe distributed storages (e.g. distributed databases);
- distributed decision-making;
- coordination of parallel and causally ordered processing, and mutual exclusion;
- basics of verification of distributed system behaviour.
On a more detailed level, students learn the basic solutions for these challenges on different levels of abstraction, in hardware, operating systems, middleware, and application-level architectures. The solutions address distributed processing and storage, their algorithms, mutual communication protocols, and failure situations with recovery options. Common solutions are discussed on replica management, data consistency models and management, and agreements between untrusted agents. Distribution benefits and disadvantages and effects of interdependencies of different solutions will be estimated.
Immediately at the beginning of the Master's studies. During the first semester of Master's studies.
Autumn term, second period, every year
This course covers key distribution topic areas as follows:
- models of communication from interprocess communication to various forms of remote communication, group communication for different application types;
- basics of distributed algorithms;
- time management in distributed or independent systems: logical clocks, partial ordering of events, causal ordering;
- mutual exclusion and shared use of resources;
- data management, including data consistency, global state and distributed snapshots, distributed transactions;
- coordination algorithms, including distributed consensus;
- fault tolerant systems, including replica management (for data, for processing);
- formal models and verification as design tools for distributed solutions;
- application examples in which the discussed solutions are used.
The course is based on the book Sukumar Ghosh: Distributed systems an algorithmic approac, 2nd edition, Chapman&Hall/CRC, 2015. Any other distributed systems textbook covering the topics of the course is also possible to use. Supplementary material will be provided during the course as needed.
Lecture course with exercise groups. Lectures open up key concepts and rationale for solutions, in exercises, details of the solutions become more familiar based on the students' own work on related tasks.
The grade is a weighted combination of the course exam and mandatory course exercises.
Separate exams last 3 hours and 30 minutes. Renewal exam (marked with "(U)") is the first separate exam after the course and also a renewal exam of course exam(s). In a renewal exam the points student has earned during the course are taken into account. Exams marked with "(HT)" are allowed only to students who have completed the obligatory projects or other exercises included in those courses. Exams marked with "(HT/U)" are renewals to students who have completed the obligatory projects during the course. Separate exams might cover different area than the lectured course. Check the course web page and contact the responsible teacher if in doubt.
Will be offered as normal contact teaching, lecture course, with weekly lectures and exercise sessions. No distance learning option, but the course can be done as a stand-alone separate exam alternatively.
Attendance is optional, but there might be compulsory elements in the course.
During the weekly exercises students solve problems, implement some algorithms and write short essays on given topics.