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.
FDD3008 Distributed Algorithms 6.0 credits
Information per course offering
Information for Autumn 2024 Start 26 Aug 2024 programme students
- Course location
KTH Campus
- Duration
- 26 Aug 2024 - 27 Oct 2024
- Periods
- P1 (6.0 hp)
- Pace of study
50%
- Application code
50981
- Form of study
Normal Daytime
- Language of instruction
English
- Course memo
- Course memo is not published
- Number of places
Places are not limited
- Target group
- No information inserted
- Planned modular schedule
- [object Object]
- Schedule
- Schedule is not published
- Part of programme
- No information inserted
Contact
Mads Dam, e-post: mfd@kth.se, tel: 790 6229
Course syllabus as PDF
Please note: all information from the Course syllabus is available on this page in an accessible format.
Course syllabus FDD3008 (Spring 2019–)Information for research students about course offerings
Look at course web page (see below) or contact Mads Dam!
Content and learning outcomes
Course contents
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.
Literature and preparations
Specific prerequisites
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
Literature
Examination and completion
If the course is discontinued, students may request to be examined during the following two academic years.
Grading scale
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
Opportunity to raise an approved grade via renewed examination
Examiner
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.