Syllabus for Concurrent Algorithms and Data Structures
Parallella algoritmer och datastrukturer
- 5 credits
- Course code: 1DL590
- Education cycle: Second cycle
Main field(s) of study and in-depth level:
Computer Science A1F
Explanation of codes
The code indicates the education cycle and in-depth level of the course in relation to other courses within the same main field of study according to the requirements for general degrees:
- G1N: has only upper-secondary level entry requirements
- G1F: has less than 60 credits in first-cycle course/s as entry requirements
- G1E: contains specially designed degree project for Higher Education Diploma
- G2F: has at least 60 credits in first-cycle course/s as entry requirements
- G2E: has at least 60 credits in first-cycle course/s as entry requirements, contains degree project for Bachelor of Arts/Bachelor of Science
- GXX: in-depth level of the course cannot be classified
- A1N: has only first-cycle course/s as entry requirements
- A1F: has second-cycle course/s as entry requirements
- A1E: contains degree project for Master of Arts/Master of Science (60 credits)
- A2E: contains degree project for Master of Arts/Master of Science (120 credits)
- AXX: in-depth level of the course cannot be classified
- Grading system: Fail (U), Pass (3), Pass with credit (4), Pass with distinction (5)
- Established: 2021-03-04
- Established by: The Faculty Board of Science and Technology
- Revised: 2022-10-17
- Revised by: The Faculty Board of Science and Technology
- Applies from: Autumn 2023
120 credits with 60 credits in computer science, including participation in Introduction to Parallel Programming. Functional programming is recommended. Proficiency in English equivalent to the Swedish upper secondary course English 6.
- Responsible department: Department of Information Technology
To pass the course, the student must be able to
- explain and design algorithms for the manipulation of simple data structures such as sets, stacks, and queues for concurrent computing;
- formulate and reason about the correctness of algorithms and data structures in the presence of parallel threads;
- use and implement basic concurrent algorithms.
Most computer applications operate nowadays on concurrent platforms, e.g., multicore architectures, distributed data bases, and geographically distributed servers. This means that all the algorithms and data structures that have along the years been designed for sequential programs must be extended to the concurrent setting. This course study how this is done in the case of basic data structures such as sets, stacks, and queues. Study of algorithms that manipulate such data structures such as insertion, deletion, and membership checking. Reasoning about the correctness and efficiency of these algorithms.
Sequential consistency, linearizability, coarse-grained synchronization, fine-grained synchronization, optimistic algorithms, lazy algorithms, lock-free algorithms, the ABA problem, atomic operations.
Lectures, labs, tutoring.
Oral and written assessment of assignments. Written exam.
If there are special reasons for doing so, an examiner may make an exception from the method of assessment indicated and allow a student to be assessed by another method. An example of special reasons might be a certificate regarding special pedagogical support from the disability coordinator of the university.
- Latest syllabus (applies from Autumn 2023)
- Previous syllabus (applies from Autumn 2021)
The reading list is missing. For further information, please contact the responsible department.