Guia docente 2013_14 Escola de Enxeñaría de Telecomunicación

Contents

Topic	Sub-topic
Introduction to Concurrent Programming	Concepts of concurrence, parallelism and multitasking. Interleaving of atomic instructions. Precedence graphs.
The critical section problem	The definition of the problem. Busy waiting. Starvation Deadlock. Dekker´s algorithm. Peterson´s algorithm
Concurrent Programming Constructs	Semaphores. The problem of the producer-consumer. The problem of the philosophers. Monitors. Variables of Condition. The problem of the readers-writers.
Deadlock	Introduction and definition of deadlock. Necessary conditions. Deadlock prevention. Deadlock avoidance. Detection and Recovery
Communication among processes	Message Passing. Remote Procedure Call (RPC).
Distributed Programming	Introduction to Distributed Systems. Distributed mutual exclusion Ricart-Agrawala Algorithm. Token ring Algorithms. Consensus: Crash Failures. Byzantine Failures.