New Technologies in Concurrent Algorithms: RDMA & Persistent Memory

Related lectures (26)

Page 1 of 3

Explores memory cache principles, emphasizing spatial locality, latency impact, and cache efficiency strategies.

Covers memory virtualization, focusing on address space abstraction and the management of memory resources by the operating system.

Explores cache memory design, hits, misses, and eviction policies in computer systems, emphasizing spatial and temporal locality.

Explains address space abstraction, focusing on memory management, stack and heap structures, and their roles in dynamic memory allocation.

Covers the representation of mathematical models, functions, and data structures in information systems.

Covers virtual memory, program relocation, memory protection, TLB, and memory hierarchy interactions.

Explains pointers and arrays in C, focusing on memory management and dynamic allocation.

Provides an overview of dynamic memory allocation in C programming, focusing on pointers and memory management techniques.

Covers Python list manipulation and comprehension, emphasizing memory representation and mutability.

Explores concurrent programming theory and practice, covering system models, cache coherence, and graph processing.