Course plan

Syllabus Computer Engineering MA, Distributed Algorithms, 6 credits

General data

  • Code: DT060A
  • Subject/Main field: Datateknik
  • Cycle: Second cycle
  • Credits: 6
  • Progressive specialization: A1F - Second cycle, has second-cycle course/s as entry requirements
  • Answerable department: Information Systems and Technology
  • Answerable faculty: Faculty of Science, Technology and Media
  • Established: 9/29/2017
  • Date of change: 6/1/2020
  • Version valid from: 7/1/2020


The course provides students with the basic knowledge to understand, analyze and design distributed algorithms. The knowledge is intended to be useful to a wide variety of research topics from the theory of distributed algorithms to protocol design, e.g. broadcasting protocols for discovery purposes in ad-hoc networks.

Course objectives

After the course the student shall be able to:
- Describe the basic underpinnings of distributed algorithms and the fundamental abstractions used to create them
- Explain consensus, broadcast and shared memory
- Explain the basics of distributed algorithms and distributed programming, and relate between selected topics in the area
- Present, analyze and evaluate (verbally and/or in written text) research articles in the area.


- models of distributed algorithms
- fault tolerance abstractions and failure detectors
- reliable broadcast, causal broadcast
- shared memory
- consensus
- byzantine fault tolerance
- virtual synchrony
- complexity

Entry requirements

Computer Engineering BA (ABC), 60 credits, including Data Structures and Algorithms. Computer Engineering MA, Distributed Systems. Mathematics BA (AB), 30 credits, including Discrete Mathematics.

Selection rules and procedures

The selection process is in accordance with the Higher Education Ordinance and the local order of admission.

Teaching form

Teaching consists of lectures, seminars and home assignments. The course can also be read as a self-study course.

Examination form

T101: Written exam, 6.0 hp
Grade scale: Seven-grade scale, A, B, C, D, E, Fx and F. Fx and F represent fail levels.

Grading criteria for the subject can be found at

The examiner has the right to offer alternative examination arrangements to students who have been granted the right to special support by Mid Sweden University’s disabilities adviser.

If examination on campus cannot be conducted according to decision by the vice-chancellor, or whom he delegated the right to, the following applies: Written Exam T101, will be replaced with two parts, online examination and follow-up. Within three weeks of the online examination, a selection of students will be contacted and asked questions regarding the examination. The follow-up consists of questions concerning the execution of the on-line exam and the answers that the student have submitted.

Grading system

Seven-grade scale, A, B, C, D, E, Fx and F. Fx and F represent fail levels.

Course reading

Required literature

  • Author: Wan Fokkink
  • Title: Distributed Algorithms: An intiutive Approach
  • Comment: ISBN: 9780262026772
  • Author: Nancy Lynch
  • Title: Distributed Algorithms
  • Publisher: Morgan Kaufmann
  • Edition: 1996
Utdelade forskningsartiklar (tillkommer)