Friedrich-Alexander-Universität Erlangen-Nürnberg  /   Technische Fakultät  /   Department Informatik

Concurrent Systems (CS) in WS 2018/19

Important: Please subscribe in the Waffel system!

Lecture content

  • Introduction
    • Overview and organisation
  • Fundamentals
    • Concurrency
      • causality (interdependencies, dimensions)
      • resource sharing (principles, competition, synchronisation)
    • Processes
      • sequential, non-sequential (concurrent, simultaneous, interacting)
      • physical (kernel/user thread) and logical (scheduling states) characteristics
    • Critical sections
      • race condition, race management (sequential/concurrent control)
      • patterns of data/control-flow races
    • Elementary operations
  • Pessimistic methods
    • Locks
    • Semaphore
    • Monitor and condition variable
    • Deadlock and livelock
  • Optimistic methods
    • Interrupt-transparent synchronisation
    • Non-blocking synchronisation
    • Transactional memory
    • Progress guarantees
  • Conclusion
    • Rummage table
    • Wrap-up

Note that the above-listed lecture topics are still under construction and subject to change.

Further information on the lecture, including schedule and printing stock, can be found here.

Exercise content

Blackboard exercises will deepen and complement the lectures contents. Additional programming tasks facilitate practical experience on concurrent systems.

More information about the exercise...

Lecturer and Tutors

UnivIS Schedule

Mo Di Mi Do Fr
08:00
09:00
10:00
10:15 - 11:45
CS
(Schröder-Preikschat)
00.151-113
11:00
12:00
13:00
14:00
14:15 - 15:45
CS-Ex
(nur 15.10., 22.10., 5.11., 12.11., 19.11., 26.11., 3.12., 10.12., 17.12., 7.1., 14.1., 21.1., 28.1., 4.2., 29.10.)
(Reif)
01.151-128
14:15 - 15:45
CS-Ex
(Reif)
00.156-113
14:15 - 15:45
CS-Ex
(Reif)
00.156-113
15:00
16:00
17:00

Überschneidung: Mo von 14:15 bis 15:45

Detailed Schedule


 
4215.1016.1017.1018.1019.10
  Lecture 01      
4322.1023.1024.1025.1026.10
Exercise 01 Lecture 02      
A01
4429.1030.1031.101.112.11
Exercise 02 Lecture 03      
A01 & A02
455.116.117.118.119.11
     
A02
4612.1113.1114.1115.1116.11
Lecture 04      
A02
4719.1120.1121.1122.1123.11
Lecture 05      
A02
4826.1127.1128.1129.1130.11
Ex. 03 & Disc. 01 Lecture 06      
A03
493.124.125.126.127.12
Discussion 02 Lecture 07      
A03
5010.1211.1212.1213.1214.12
Comp. Ex. Lecture 08      
A03
5117.1218.1219.1220.1221.12
Exercise 04 Lecture 09      
A04
5224.1225.1226.1227.1228.12
         
131.121.12.13.14.1
         
27.18.19.110.111.1
     
A04
314.115.116.117.118.1
Exercise 05 Lecture 10      
A05
421.122.123.124.125.1
Discussion 03 & 04 Lecture 11      
A05
528.129.130.131.11.2
Comp. Ex. Lecture 12      
A05
64.25.26.27.28.2
Discussion 05 Lecture 13