FDD3008 Distributed Algorithms 6.0 credits

Distribuerade algoritmer

Introductory postgraduate level course in computer science on the theory, algorithms, and techniques of parallel and distributed computing systems.

Offering and execution

Course offering missing for current semester as well as for previous and coming semesters

Course information

Content and learning outcomes

Course contents *

Parallel and distributed algorithms are fundamental to many aspects of modern computing and communications technology, including processor architectures (multicore, manycore), programming languages and operating systems, databases, and networks. The course covers the principles of parallel and distributed algorithms, emphasizing the fundamental issues underlying the design and analysis of distributed systems, including synchronization, communication, coordination, agreement, fault-tolerance, locality, symmetry breaking, self-organization.

Intended learning outcomes *

Upon completion of the course the student should be able to:

  • understand and account for models, limitations, and fundamental concepts in the area of message passing and shared memory concurrency, and apply this understanding to example systems and algorithms,
  • adapt, and design algorithms for execution in parallel and distributed settings,
  • analyze the algorithms for correctness, reliability, security, and performance.

Course Disposition

No information inserted

Literature and preparations

Specific prerequisites *

No information inserted

Recommended prerequisites

The course does not have formal prerequisites. Target audience is first or second year postgraduate students in computer science. Postgraduate students in other subjects are welcome to attend. Familiarity with algorithms and their theory, basic probability theory, and basic mathematical discourse in cs, and programming experience will be very useful. We assume a level corresponding to the required courses of the KTH D and/or F programs.

Equipment

No information inserted

Literature

No information inserted

Examination and completion

If the course is discontinued, students may request to be examined during the following two academic years.

Grading scale *

P, F

Examination *

  • EXA1 - Examination, 6.0 credits, Grading scale: P, F

Based on recommendation from KTH’s coordinator for disabilities, the examiner will decide how to adapt an examination for students with documented disability.

The examiner may apply another examination format when re-examining individual students.

Other requirements for final grade *

The course is examined through handins, participation in marking, an oral paper presentation, and a written report.

Opportunity to complete the requirements via supplementary examination

No information inserted

Opportunity to raise an approved grade via renewed examination

No information inserted

Examiner

Mads Dam

Ethical approach *

  • All members of a group are responsible for the group's work.
  • In any assessment, every student shall honestly disclose any help received and sources used.
  • In an oral assessment, every student shall be able to present and answer questions about the entire assignment and solution.

Further information

Course web

Further information about the course can be found on the Course web at the link below. Information on the Course web will later be moved to this site.

Course web FDD3008

Offered by

EECS/Theoretical Computer Science

Main field of study *

No information inserted

Education cycle *

Third cycle

Add-on studies

No information inserted

Contact

Mads Dam, e-post: mfd@kth.se, tel: 790 6229

Postgraduate course

Postgraduate courses at EECS/Theoretical Computer Science