ConceptSystems & CS
Concurrency
The ability to run multiple tasks by interleaving execution on a single core or multiple cores, giving the illusion of simultaneous execution.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
CPU core2Interrupts2Processes2Scheduling2Thread2Garbage collection1Multi-core machines1Multitasking1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
7Each in their own terms, from the easiest level.
Frans Kaashoek
The ability of the garbage collector and the application to run simultaneously without interfering with each other.Rob Pike
The composition of independently executing processes.Frans Kaashoek & Robert Morris
The simultaneous operation of the CPU and external devices, where both perform tasks independently and in parallel.Tim Mattson
You have lots of things happening and they are unordered with respect to each other.Albert Reuther
A condition of a system in which multiple tasks are active and unordered, logically making forward progress if scheduled fairly.Sergey Levine
Concurrency describes when multiple tasksessive execution interleaving execution of tasks tasks interleaved interleaved on a single CPU core, or true simultaneous execution on multiple coresей on multicore multicore processors
Lectures that assume it
31The first 12 are shown.
- Google Spanner: TrueTime & Globally Distributed Transactions
- Read-Copy-Update (RCU)
- RPC, Concurrency & Threads in Go
- Thinking Like a Compiler: Program Obfuscation from the Other Side
- Linearizability
- Networking
- Go Concurrency Patterns, Condition Variables & Raft Prep
- The Power of Abstraction (ACM A.M. Turing Award Lecture)
- Crash Recovery
- Introduction to Parallel Programming with OpenMP (Part 2)
- CRDTs: The Hard Parts
- Consensus & Fault Tolerance — Raft (Part 1)
Connections
48The lectures that define it or assume it, and the concepts next to it.
Concepts9
Show 3 moreShow fewer
Lectures39
- Concurrency Is Not Parallelism
- RL Theory
- Practical HPC Architectures & Workflows
- Interrupts
- File System Performance and Fast Crash Recovery
- Virtual Memory for Applications
Show 33 moreShow fewer
- Introduction to Parallel Programming with OpenMP (Part 1)
- Handling Cancellation in Concurrent Systems
- Google Spanner: TrueTime & Globally Distributed Transactions
- Read-Copy-Update (RCU)
- RPC, Concurrency & Threads in Go
- Thinking Like a Compiler: Program Obfuscation from the Other Side
- Linearizability
- Networking
- Go Concurrency Patterns, Condition Variables & Raft Prep
- The Power of Abstraction (ACM A.M. Turing Award Lecture)
- Crash Recovery
- Introduction to Parallel Programming with OpenMP (Part 2)
- CRDTs: The Hard Parts
- Consensus & Fault Tolerance — Raft (Part 1)
- Effective Programs: Situated Information Systems vs. In-Memory Object Graphs
- Index Concurrency Control
- Optimistic Concurrency Control
- Synchronization Without Locks
- Multiprocessors and Locks
- Kernels and High Level Languages HLL
- More Replication, CRAQ
- Fail: Jmp Fail (Everything I Got Wrong in RE and Security Research)
- Data Parallel Haskell
- SIMD Architectures
- Deterministic Concurrency
- Keynote: Notes on the Synthesis of Time in Computational Systems
- Category Theory 1.1: Motivation and Philosophy
- Could Computing Be Simpler Than It Seems To Be?
- Why Functional Programming Matters
- Java for Agentic Development: A Case for Stability and Robustness
- Postgres On, Vs, With Linux
- Clean Code III: Functions
- Porting Ideas, Not Code: Reimagining Clojure and Datomic Concepts in a Language-Agnostic Data Platform