Syllabus

Title
5865 Distributed Systems Group B
Instructors
Assoz.Prof PD Dr. Stefan Sobernig, Assoz.Prof PD Dr. Mark Strembeck
Contact details
Type
PI
Weekly hours
2
Language of instruction
Englisch
Registration
02/12/24 to 02/15/24
Registration via LPIS
Notes to the course
This class is only offered in summer semesters.
Subject(s) Master Programs
Dates
Day Date Time Room
Tuesday 05/07/24 10:00 AM - 02:30 PM D5.0.002
Tuesday 05/14/24 10:00 AM - 02:30 PM TC.3.21
Tuesday 05/21/24 10:00 AM - 02:30 PM TC.3.21
Monday 05/27/24 03:00 PM - 05:00 PM TC.5.27
Tuesday 05/28/24 10:00 AM - 02:30 PM TC.3.21
Monday 06/03/24 03:30 PM - 05:30 PM TC.5.27
Tuesday 06/04/24 10:00 AM - 02:30 PM TC.3.21
Tuesday 06/11/24 09:30 AM - 03:30 PM TC.3.05
Friday 06/14/24 01:00 PM - 03:30 PM TC.5.05
Tuesday 06/18/24 11:00 AM - 12:30 PM TC.0.03 WIENER STÄDTISCHE
Contents
In this course we will discuss:
  • the basic characteristics of distributed systems;
  • architectures of distributed systems;
  • problems related to the communication in distributed systems;
  • methods and techniques to address such problems;
  • different types of middleware;
  • software patterns for distributed systems;
  • an introduction to graph theory and graph algorithms.

The course focuses on generic concepts, techniques, methods, and open standards for distributed systems.
We do not (explicitly) discuss the implementation of distributed systems via a particular programming language or software platform.

Please answer the self-assessment questions available from the download section to check your knowledge.


Learning outcomes

After completing the course, students understand the definition and the purpose of different network measures, to answer questions on:

  • the basic characteristics of distributed systems;
  • architectures of distributed systems;
  • problems related to the communication in distributed systems;
  • methods and techniques to address such problems;
  • different types of middleware;
  • software patterns for distributed systems;
  • graph theory and graph algorithms.
Attendance requirements

According to the examination regulation, 80% attendance is required for a PI. This means that absence in one unit is tolerated. Beyond that, an exceptional reason must be given in accordance with WU's examination regulation. Any absence must be notified by email to the contact address before the start of the course.

Teaching/learning method(s)

The course is delivered using a combination of the following:

  • presentation by facilitators;
  • technical tutorials by student tutors;
  • self-study of compulsory special literature by students;
Assessment
  • 2 in-class exams counting for 20 points each;
  • 1 final exam counting for 60 points;
  • A positive grade is awarded if at least 50% of all points (i.e. 50/100) are earned. The remaining grades are awarded in 10% steps (60%, 70%, 80%). Thus, a "1, excellent" is awarded if at least 80% (i.e. 80/100) of all points have been earned.
  • Each student who participates in at least one of the 3 exams is graded.
  • If a student fails the entire course (i.e. finishes with a negative grade), the student will be allowed a single repeat of the final exam, given the following conditions hold:
    • the student earned at least 15/40 points from the in-class exams;
    • and the student earned at least 15/60 points from the final exam.
  • The best grade possible for this single repeat is "satisfactory" (3, "befriedigend").
  • If one or both of the above conditions are missed, students will have to repeat the entire course (incl. all exams) in a subsequent semester.

 

Readings

Please log in with your WU account to use all functionalities of read!t. For off-campus access to our licensed electronic resources, remember to activate your VPN connection connection. In case you encounter any technical problems or have questions regarding read!t, please feel free to contact the library at readinglists@wu.ac.at.

Last edited: 2024-02-20



Back