Course plan

Save favourite

View syllabus
Syllabus:

Computer Engineering MA, Distributed Algorithms, 7.5 Credits


General data

Code: DT043A
Subject/Main field: Datateknik
Cycle: Second cycle
Credits: 7.5
Progressive specialization: A1N - Second cycle, has only first-cycle course/s as entry requirements
Answerable department: Department of Information and Communication Systems
Answerable faculty: Faculty of Science, Technology and Media
Established: 5/12/2014
Date of change: 3/30/2015
Version valid from: 7/1/2014

Aim

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 the ability to relate between selected topics in the area
- Present, analyze and evaluate (verbally and/or in written text) research articles in the area.

Content

The course include:
- 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, and TCP/IP Internetworking, Computer Engineering MA, Distributed System I, 7.5 Credits, and Mathematics BA (AB), 30 Credits, including Discrete Mathematics and Mathematical Statistics.

Selection rules and procedures

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

Teaching form

Teaching consists of lectures, seminars, home assignments and project assignment.

The course can also be read as a self-study course.

Examination form

6.0 Credits, T101: Written exam
Grades: A, B, C, D, E, Fx and F. A-E are passed and Fx and F are failed.

1.5 Credits, P101: Project
Grades: Pass or Fail

Grading criteria for the subject can be found at www.miun.se/gradingcriteria.

Grading system

The grades A, B, C, D, E, Fx and F are given on the course. On this scale the grades A through E represent pass levels, whereas Fx and F represent fail levels.

Course reading


Required literature

Author: Nancy Lynch
Title: Distributed Algorithms
Edition: 1996
Publisher: Morgan Kaufmann

Author: Wan Fokkink
Title: Distributed Algorithms: An intiutive Approach
Comment: ISBN: 9780262026772

Utdelade forskningsartiklar (tillkommer)

Other information

Studenter registrerade på denna version av kursplan har rätt att examineras 3 gånger inom loppet av 1 år enligt angivna examinationsformer. Därefter gäller examinationsform enligt senast gällande version av kursplan.