Skip to main content

Distributed Systems Computer

2026/2027
Programme:
Interdisciplinary University Study Programme Computer Science and Mathematics
Year:
3 year
Semester:
first
Kind:
optional
ECTS:
6
Language:
slovenian
Course director:

Uroš Lotrič

Hours per week – 1. semester:
Lectures
3
Seminar
0
Tutorial
2
Lab
0
Content (Syllabus outline)

1. Parallel systems architecture.

2. Concurrency, processes and threads: interleaving, parallelism, execution order, pre-emption.

3. Working with threads: creation, joining, and problems.

4. Concurrent access to shared data: race condition and mutual exclusion, atomic operations.

5. Event synchronisation: deadlock, conditional variables, barrier.

6. Patterns: semaphores, producer-consumer, readers and writers, task pool.

7. Multithreading in practice: thread-safe programming, advantages of multithreaded programs, multithreaded program models

8. Graphical accelerator architecture.

9. Graphical accelerator programming, offload model.

10. Distributed systems: benefits and challenges, network protocols, client-server systems, remote function calling (RPC).

11. Systems models and faults: synchronous, partially synchronous and non-synchronous, system failure, faults and fault tolerance, Byzantine faults and the two-generals problem.

12. Clock time and event classification: physical clocks, universal time, time synchronisation and drift, protocol NTP, causality.

13. Logical time: Lamport clock, vector clocks, broadcast.

14. Replication and quorums: replica consistency, read-after-write consistency, state machine replication, leader-based replication.

15. Consensus: leader selection, the Raft algorithm.

16. Distributed systems use cases: consensus, causal propagation, two-stage commit.

Readings
  1. P.S. Pacheco. An Introduction to Parallel Programming, Morgan Kaufman, 201
  2. V. Alessandrini, Shared Memory Application Programming, Concepts and strategies in multicore application programming, Morgan Kaufmann, 2016.
  3. B.R. Gaster et al. Heterogeneous computing with OpenCL. Morgan Kaufmann, 201
  4. A.S. Tanenbaum and M. van Steen. Distributed systems, 3rd edition, CreateSpace Independent Publishing Platform, 2017.
  5. G. Couloris et al. Distributed Systems: Concepts and Design. Pearson, 2012.
Objectives and competences

Understand the fundamental concepts and principles of parallel and distributed systems from the point of view of computer architecture, algorithms and programming models; develop the skills and techniques to design, build and test parallel and distributed applications using selected programming languages and tools, be able to evaluate the applicability of different models and approaches to achieve a desired goal, apply the acquired knowledge of parallel and distributed systems to solve common problems and challenges.

Intended learning outcomes

After completing the course successfully, the student will be familiar with standard parallel and distributed computing systems. In parallel systems, the student will have an in-depth knowledge of working with threads and be able to identify problems in multithreaded applications and solve them using familiar concepts. He will be familiar with the selected programming languages and tools offered to control the operation of threads. He will be able to assess the impact of different approaches on the application's robustness, performance and correctness. The student will be familiar with the architecture of graphics accelerators and the concept of offloading the workload to the accelerator. He will be familiar with distributed system architectures, and the impact of network interconnects on their performance, as well as with different programming models and abstractions, such as the RPC protocol, and their use in selected programming languages. Besides, he will understand concepts such as logical time and causality and learn about fault tolerance, data replication approaches, and consensus and leader selection algorithms.

Learning and teaching methods

Lectures, laboratories, homework

Assessment

Type (examination, oral, homework):

Home assignments
Oral exam

Grading: 6-10 pass, 5 fail (according to the rules of University of Ljubljana).

Lecturer's references
  1. SILVA, Catarina, LOTRIČ, Uroš, RIBEIRO, Bernardete, DOBNIKAR, Andrej. Distributed text classification with an ensemble kernel-based learning approach. IEEE trans. syst. man cybern., Part C Appl. rev., May 2010, vol. 40, 287-297
  2. CANKAR, Matija, ARTAČ, Matej, ŠTERK, Marjan, LOTRIČ, Uroš, SLIVNIK, Boštjan. Co-allocation with collective requests in grid systems. Journal for universal computer science, 2013, vol. 96, 282-300
  3. LOTRIČ, Uroš, PILIPOVIĆ, Ratko, BULIĆ, Patricio. A hybrid radix-4 and approximate logarithmic multiplier for energy efficient image processing. Electronics. May 2021, vol. 10, 1-20
  4. PILIPOVIĆ, Ratko, BULIĆ, Patricio, LOTRIČ, Uroš. A two-stage operand trimming approximate logarithmic multiplier. IEEE transactions on circuits and systems. I, Regular papers. Jun. 2021, vol. 68, 2535-2545
  5. PILIPOVIĆ, Ratko, RISOJEVIĆ, Vladimir, BOŽIČ, Janko, BULIĆ, Patricio, LOTRIČ, Uroš. An approximate GEMM unit for energy-efficient object detection. Sensors. Jun. 2021, vol. 21, 1-19 Celotna bibliografija je dostopna na SICRIS: https://bib.cobiss.net/biblioweb/biblio/si/slv/cris/16109