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

Concurrent Systems (CS) in WS 2015/16

Important: Please subscribe in the Waffel system!
Contact me if you cannot log in: drescher@cs.fau.de

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
11:00
12:00
13:00
14:00
14:15 - 15:45
CS-Ex
(Drescher)
0.031-113, 00.156-113
14:15 - 15:45
CS
(Schröder-Preikschat)
0.035
14:15 - 15:45
CS-Ex
(Drescher)
0.031-113, 00.156-113
15:00
16:00
17:00

Detailed Schedule

The exercises shown here are blackboard exercises, they will take place in 0.031. On all other dates on monday and friday there will be computer exercises in 00.156.
 
CWMoTuWeThFr
4212.1013.1014.1015.1016.10
    Lecture 1    
4319.1020.1021.1022.1023.10
Exercise 1   Lecture 2   Exercise 1
4426.1027.1028.1029.1030.10
    Lecture 3    
452.113.114.115.116.11
Exercise 2   Lecture 4   Exercise 2
469.1110.1111.1112.1113.11
    Lecture 5    
4716.1117.1118.1119.1120.11
Exercise 3   Lecture 6   Exercise 3
4823.1124.1125.1126.1127.11
    Lecture 7   Comp. ex.
canceled
4930.111.122.123.124.12
    Lecture 8    
507.128.129.1210.1211.12
    Lecture 9   Comp. ex.
canceled
5114.1215.1216.1217.1218.12
Exercise 4   Lecture 10   Exercise 4
5221.1222.1223.1224.1225.12
     
5328.1229.1230.1231.121.1
semester break
14.15.16.17.18.1
     
211.112.113.114.115.1
    Lecture 11    
318.119.120.121.122.1
    Lecture 12    
425.126.127.128.129.1
Comp. ex.
canceled
  Lecture 13   Comp. ex.
canceled
51.22.23.24.25.2
Comp. ex.
canceled
  Lecture 14   Comp. ex.
canceled
 
The exercises shown here are blackboard exercises, they will take place in 0.031. On all other dates on monday and friday there will be computer exercises in 00.156.