Memory, cache locality and why arrays are fast (data structures and optimization)

Memory, cache locality and why arrays are fast (data structures and optimization)

HomeSimonDevMemory, cache locality and why arrays are fast (data structures and optimization)
Memory, cache locality and why arrays are fast (data structures and optimization)
ChannelPublish DateThumbnail & View CountDownload Video
Channel AvatarPublish Date not found Thumbnail
0 Views
Why is the first loop 10 times faster than the second even though it does exactly the same work?

Follow me on:
Twitter: https://twitter.com/iced_coffee_dev
Github: https://github.com/simondevyoutube/

In this video, we'll talk a bit about memory, CPU caches (specifically L1/L2/L3 cache), hardware prefetching, and how all of this comes together with arrays. We'll cover each of these topics in enough detail for you to develop a solid understanding, and use real-world examples to illustrate the point. We'll talk about the most basic data structure, arrays, how they work, what situations they're great for, and when they don't work. We'll also touch on some algorithmic complexity. Finally, we'll talk about why it's important to understand this, and how it leads to more advanced topics and data structures.

What is covered:
* How memory allocation works, memory addresses
* Contiguous memory
* CPU caches, L1/L2/L3 cache
* Hardware prefetching
* Array operations, what is fast and what is not
* Final thoughts on why it is important to understand this, how this relates to more advanced data structures

Please take the opportunity to connect with your friends and family and share this video with them if you find it useful.

Tagged:
If you enjoyed watching Memory, cache locality and why arrays are fast (data structures and optimization).
Don't Forget to Say Thank You comment below... ^_^