Видео 29
Просмотров 51 531

Cache Hierarchy: How Modern CPU Caches Are Organized

6:53

CPU Cache Write Policies Explained

7:06

Cache Replacement Policy: What Happens When The CPU Runs Out of Cache Memory?

9:43

How Cache Works Inside a CPU

9:20

1 Thread vs. 1000 Threads: How Fast Can C++ Increment a Value?

1:26

Bitwise Operations: The Most Underappreciated Feature in Low-Level Programming

7:24

Cache vs RAM: The Speed Difference Explained

Beginner's Guide to CPU Caches (E-Book): buymeacoffee.com/bitlemonsoftware/e/362123
There are several reasons why cache access is much faster than main memory: the proximity of the memory to the processor core, the bus width, the complexity of the data transfer protocol, and the technology behind each type of memory.
While proximity to the processor core, bus width, and data transfer protocol all play a role, the memory technology has the biggest impact on access latency.
In this video, I talk about the difference between cache memory technology (SRAM), and main memory technology (DRAM).
CPU Cache Playlist: ruclips.net/p/PL38NNHQLqJqYnNrTenxBvGJSPCkV9EOWk&si=c8iKNmWxzEq7qODB
Support my work: b...

Видео

Cache Hierarchy: How Modern CPU Caches Are Organized

6:53

Cache Hierarchy: How Modern CPU Caches Are Organized

Просмотров 10 тыс.Месяц назад

Beginner's Guide to CPU Caches (E-Book): buymeacoffee.com/bitlemonsoftware/e/362123 Modern CPUs have multiple caches. In fact, they have a whole cache hierarchy. In this video, I discuss how modern CPU cache hierarchies are structured, describe the properties of each cache level, explain cache inclusion policies, and provide an example of how the processor reads and writes data within the cache...

7:06

CPU Cache Write Policies Explained

Просмотров 2,2 тыс.2 месяца назад

Beginner's Guide to CPU Caches (E-Book): buymeacoffee.com/bitlemonsoftware/e/362123 Every time the CPU reads data from the cache, it is guaranteed to receive the correct, up-to-date data that corresponds to the requested address in main memory, regardless of whether it's a read hit or a read miss. Writing to the cache introduces a challenge: when a block of data in the cache is modified, the ma...

Cache Replacement Policy: What Happens When The CPU Runs Out of Cache Memory?

9:43

Cache Replacement Policy: What Happens When The CPU Runs Out of Cache Memory?

Просмотров 1,7 тыс.2 месяца назад

Beginner's Guide to CPU Caches (E-Book): buymeacoffee.com/bitlemonsoftware/e/362123 When a cache miss occurs, the CPU needs to load the data from the main memory into the cache. However, if the target cache set is already full, it must decide which existing data in the set to evict. This decision is made using a replacement algorithm. There are many types of cache replacement policies, each wit...

9:20

How Cache Works Inside a CPU

Просмотров 28 тыс.4 месяца назад

Beginner's Guide to CPU Caches (E-Book): buymeacoffee.com/bitlemonsoftware/e/362123 Caching is a large and complex subject. In this video, I explain the basics of a CPU cache: • What is the CPU cache and what is it good for? • How data is transferred between the CPU, main memory and cache • Cache hit and cache miss concepts • Locality of Reference principle • Structure of a cache memory • Cache...

1 Thread vs. 1000 Threads: How Fast Can C++ Increment a Value?

1:26

1 Thread vs. 1000 Threads: How Fast Can C++ Increment a Value?

Просмотров 4345 месяцев назад

How fast can C increment a value 1 billion times? In this video, I try incrementing a value using a varying number of threads, from a single thread up to 1,000 threads. The results might surprise you. Support my work: buymeacoffee.com/bitlemonsoftware #cpp #code #programming #computerscience #cpptutorial #software #softwareengineer #parallelprogramming #threads #cppthreads

Bitwise Operations: The Most Underappreciated Feature in Low-Level Programming

7:24

Bitwise Operations: The Most Underappreciated Feature in Low-Level Programming

Просмотров 4435 месяцев назад

Bitwise operations are low-level operations that directly modify individual bits within a binary number. They are fundamental to computer science and are used in many applications where performance and memory efficiency are critical and need to be handled with the utmost precision. Where Are Bitwise Operations Used? - Low-level programming: Bitwise operations are the bread and butter of systems...

2:48

C++ Vectors Explained in 168 seconds

Просмотров 2535 месяцев назад

A vector in C is a dynamic array that can resize itself automatically when elements are added or removed, as opposed to an array, which has a constant size. Similar to arrays, vectors can only contain one type of object, so when defining a vector, you must specify the type of object that will be stored in that vector. Elements in a vector are stored next to each other in memory, making access a...

Binary Search Tree in C++: How to Determine if a Binary Tree is Perfect or Not

5:21

Binary Search Tree in C++: How to Determine if a Binary Tree is Perfect or Not

Просмотров 856 месяцев назад

A Perfect Binary Tree is a tree in which all internal nodes have two children and all leaves are found at the same level. If both of those conditions are met, the tree is considered perfect. Otherwise, it's not perfect. Since the recursive algorithm has to distinguish between leaf nodes and internal nodes, and also verify that internal nodes have exactly two children, it has to handle fout diff...

Binary Search Tree in C++: Getting the Level of a Specific Node in the Tree

4:57

Binary Search Tree in C++: Getting the Level of a Specific Node in the Tree

Просмотров 236 месяцев назад

In this episode of the Binary Search Tree series, we are talking about how to find the level of a specific node in the tree. The level of a node is the depth of the node in the tree. The root node is found at level 1, its children are at level 2, their children are at level 3, and so on. In this episode, I implement the GetNodeLevel method, which uses an internal recursive method to find the le...