Module Handbook

  • Dynamischer Default-Fachbereich geändert auf INF

Module INF-56-54-M-5

Replication and Consistency (M, 4.0 LP)

Module Identification

Module Number Module Name CP (Effort)
INF-56-54-M-5 Replication and Consistency 4.0 CP (120 h)

Basedata

CP, Effort 4.0 CP = 120 h
Position of the semester 1 Sem. in WiSe
Level [5] Master (Entry Level)
Language [DE/EN] German or English as required
Module Manager
Lecturers
Area of study [INF-ALG] Algorithmics and Deduction
Reference course of study [INF-88.79-SG] M.Sc. Computer Science
Livecycle-State [NORM] Active

Courses

Type/SWS Course Number Title Choice in
Module-Part
Presence-Time /
Self-Study
SL SL is
required for exa.
PL CP Sem.
2V+1U INF-56-54-K-5
Replication and Consistency
P 42 h 78 h
U-Schein
ja PL1 4.0 WiSe
  • About [INF-56-54-K-5]: Title: "Replication and Consistency"; Presence-Time: 42 h; Self-Study: 78 h
  • About [INF-56-54-K-5]: The study achievement "[U-Schein] proof of successful participation in the exercise classes (ungraded)" must be obtained.
    • It is a prerequisite for the examination for PL1.

Examination achievement PL1

  • Form of examination: written or oral examination
  • Examination number: 65654 ("Replikation und Konsistenz")
    Type of examination will be announced in the lecture. Duration of the examination: ref. examination regulations.

Evaluation of grades

The grade of the module examination is also the module grade.


Contents

  • correctness criteria
    • happens before
    • sequential consistency
    • histories
    • abstract executions
    • linearizability
    • compositionality
  • non-blocking synchronization in shared memory architectures
    • primitive synchronization operations
    • ABA problem
    • single concatenated data structures
    • stacks
    • LIFO lists
  • hardware storage models
    • Total Store Order (TSO)
    • axiomatic memory models
    • Data-Race-Freedom
    • robustiness
  • non-blocking synchronization in distributed systems
    • consistency models in distributed systems
    • replicated data types
    • snapshots
    • invariants

Competencies / intended learning achievements

After successful completion of the module, students will be able to
  • formally describe and compare common consistency models,
  • understand and explain how classical concurrent and replicated data structures work,
  • explain and justify the limits of non-blocking synchronization,
  • separate application areas of replication in distributed systems.

Literature

  • M. Herlihy & Nir Shavit. The Art of Multiprocessor Programming, Morgan Kaufmann.
  • B. Charron-Bost, F. Pedone, A. Schiper (ed.) Replication. Springer LNCS, 2010.

Requirements for attendance of the module (informal)

None

Requirements for attendance of the module (formal)

None

References to Module / Module Number [INF-56-54-M-5]

Course of Study Section Choice/Obligation
[INF-88.79-SG] M.Sc. Computer Science [Specialisation] Specialization 1 [WP] Compulsory Elective
[INF-88.79-SG] M.Sc. Computer Science [Specialisation] Specialization 1 [WP] Compulsory Elective
Module-Pool Name
[INF-SE_Ba_V-MPOOL-4] Specialization Bachelor TA Software Engineering