What LSM trees optimize: write-heavy workloads by buffering writes in memory

Why memory coalescing matters — adjacent threads reading adjacent memory addresses

Memory coalescing reduces cache misses, improving multithreaded application performance

How do lock-free data structures manage concurrent access to shared memory in a multithreaded environment?

Lock-free data structures use atomic operations to ensure concurrent access without traditional locking mechanisms

How tiling works in matrix multiplication — loading blocks into shared memory

Tiling in matrix multiplication optimizes cache usage by partitioning matrices into submatrices

What bank conflicts are in shared memory — multiple threads accessing the same bank

Shared memory conflicts arise when multiple threads concurrently access the same bank in a banking system

What a message queue decouples: producer and consumer can operate at different speeds

Message queues decouple producers and consumers, allowing asynchronous processing

Time complexity of Dijkstra's algorithm: O((V+E) log V) with a priority queue

Dijkstra's algorithm: O((V+E) log V) using a Fibonacci heap