Lecture

Concurrency and Parallelism: Queue

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Related lectures (64)

Parallelism and Concurrency

Covers the course CS206 on Parallelism and Concurrency, including logistics, materials, exercise sessions, labs, exams, and grading criteria.

Principles of Parallel Computing: OpenMP

Explores the principles of parallel computing, focusing on OpenMP as a tool for creating concurrent code from serial code.

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.

Functional Programming: Concepts and History

Explores imperative programming limitations, theories without mutation, functional programming principles, and the history of functional languages.

Transaction Management & Concurrency Control

Explores transaction management, concurrency control, ACID properties, anomalies, and conflict serializability in database systems.

Asynchronous Programming: Callbacks and Failures

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

Concurrency Properties: Basics and Locks

Explores concurrency properties, race conditions, and the basics of locks.

Concurrency and transactional memory in Dafny

Covers Dafny basics, modeling concurrency, and implementing transactional memory with safety and liveness proofs.

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.

Transactions & Concurrency Control: Pessimistic CC

Explores transactions, concurrency control, deadlock handling, and challenges in dynamic databases.

Memory Consistency Models: Performance Impact and Parallel Computing

Covers memory consistency models, parallel computing, atomic subroutines, GPU architecture, and multithreading.

Transactions

Explores the elegance and challenges of transactions in structuring stateful systems, emphasizing ACID properties and the trade-offs of transactional memory.

Formal Verification and Program Synthesis

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

Anonymous Concurrent Computing

Explores anonymous concurrent computing, covering counters, snapshots, and consensus algorithms.

Concurrency Semantics and Verification

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

Conc-Trees: Parallel Programming in Scala

Covers the implementation of Conc-Trees in Scala for parallel programming.

Synchronization Inference

Explores automatic synthesis of correct and efficient synchronization in programs, focusing on removing redundant atomicity and adding synchronization metadata.

Hybrid Programming Models Comparison

Compares hybrid programming models, discusses project proposals, and emphasizes the importance of considering physical topology in application development.

Edge Computing: Enhancing Performance with Klepsydra MOOC: New Space Economy

Explores Klepsydra's innovative edge computing solutions and their impact on various sectors, emphasizing the importance of lock-free programming techniques.

Parallel Computation: Tasks

Explores parallel computation using tasks for concurrent execution and demonstrates their implementation in practice.