Introduction to Concurrency

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (32)

Page 3 of 4

Concurrency Semantics and Verification

Explores concurrency semantics, recursive functions, loops, interleaving modeling, and interpreter verification.

Locks: Implementing Concurrency Mechanisms

Covers the implementation of locks using compareAndSet and the concept of fair locks.

Concurrency and Mutual Exclusion

Covers the importance of concurrency, atomic operations, and mutual exclusion using locks.

Formal Verification and Program Synthesis

By the instructor Viktor Kuncak explores formal verification, program synthesis, and teaching activities at EPFL.

Distributed Transactions: Coordination, Concurrency Control, and Recovery

Explores distributed transactions, covering coordination, concurrency control, recovery, and the Two-Phase Commit protocol.

Asynchronous Programming: Callbacks and Failures

Covers the concept of asynchronous programming and how to handle dependencies and failures.

Hardware Verification using High-Level Design Languages

Explores challenges in hardware verification, clear specifications, speculation harm, and cycle-precise semantics.

Concurrency with Futures

Explores futures as a structured approach to concurrency, simplifying parallel tasks and input-output operations.

Theoretical Foundations for Emerging Multiprocessor Technologies: RDMA and NVRAM

Explores theoretical foundations for RDMA and NVRAM in multiprocessor technologies, covering contention, concurrency control, and fault tolerance.

The Power of Registers

Covers wait-free implementations of atomic objects, focusing on counters and snapshots, discussing key ideas for enforcing atomicity and wait-freedom.