Lecture 8. Unit 7. Formal Defintions of Consistency (optional)
published: Feb. 28, 2018, recorded: February 2018, views: 5
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Watch videos: (click on thumbnail to launch)
The course complements Distributed Systems, Basic Course, and prepares the students for M.Sc projects, and Ph.D. studies in the area of distributed systems.
The main objective of this course is to provide the students with a solid foundation for understanding, analyzing and designing distributed algorithms for reliable distributed systems.
More specifically after the course is completed the student will:
- Know how to specify the properties of distributed algorithms, so called liveness and safety properties.
- Explain the different models of distributed systems, including failure and timing models.
- Master basic algorithms for failure detection, leader elections, broadcast and multicast, basic shared memory in distributed systems, agreement protocols, and group communication.
- Practice in design and implementation of selected distributed algorithms in middleware designed for group communication.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !