Lectures related to New Technologies in Concurrent Algorithms: RDMA & Persistent Memory

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

Memory Virtualization: Address Space Abstraction and Management

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

Cache Memory

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

Memory Management: Address Space Abstraction

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

Model Representation: Structures and Functions

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

Virtual Memory

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

Pointers and Arrays: Memory Management in C

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

Dynamic Memory Allocation: Understanding Pointers in C

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

Python Lists: Manipulation and Comprehension

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

Concurrent Programming: Theory to Practice

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

Concurrency and Parallelism: Visibility

Explores visibility in concurrency, memory models, shared memory, and hardware optimizations.

Device Management in Operating Systems: Chaperones and Persistence

Discusses device management in operating systems, focusing on device drivers, persistence, and performance optimization techniques.

Purely Functional Priority Queue

Covers optimal purely functional priority queues, Scala implementation, Stainless integration, operations properties, and binomial queues.

Untitled

Data Representation: Models and Systems

Discusses data representation through models and systems, covering mathematical models, data structures, levels of modeling, and managing data.

Understanding Vectors: sizeof()

Explores the C++ vector, emphasizing the sizeof operator and vector analysis.

Dynamic Data Structures: Vectors and Linked Lists

Covers the comparison between vectors and linked lists in C++ programming.

MIPS Assembly: Function Calls & Memory Management

Explores MIPS assembly language, covering function calls, memory management, and data structures, including recursive functions, programming constructs, arrays, and linked lists.

Dynamic Arrays in C++: Features and Performance

Covers the implementation and manipulation of dynamic arrays in C++ using vectors, focusing on their features and performance implications.

Introduction to C Programming

Introduces fundamental C programming concepts, covering variables, control structures, functions, and pointers, with practical examples and exercises.