Channel | Publish Date | Thumbnail & View Count | Download Video |
---|---|---|---|
Publish Date not found | 0 Views |
When analyzing speed, people always talk about Big-O time, but Big O isn't the only important factor when writing high-performance code. Two important things to keep in mind are cache locality (locality of reference) and branch predictability. In this video, we'll explore these ideas and see, with examples, the huge impact they can have on performance.
― mCoding with James Murphy (https://mcoding.io)
Source code: https://github.com/mCodingLLC/VideosSampleCode
Branch prediction: https://en.wikipedia.org/wiki/Branch_predictor
Cache location: https://en.wikipedia.org/wiki/Locality_of_reference
Great CppCon talk: https://www.youtube.com/watch?v=2EWejmkKlxs
SUPPORT ME
—————————————————
Patreon: https://patreon.com/mCoding
Paypal: https://www.paypal.com/donate/?hosted_button_id=VJY5SLZ8BJHEE
Other donations: https://mcoding.io/donate
Key Supporters and Donors: Jameson, Laura M, Dragos C, Vahnekie, John Martin, Casey G, Pieter G, Krisztian M, Sigmanificient
BE ACTIVE IN MY COMMUNITY
—————————————————
Discord: https://discord.gg/Ye9yJtZQuN
Github: https://github.com/mCodingLLC/
Reddit: https://www.reddit.com/r/mCoding/
Facebook: https://www.facebook.com/james.mcoding
CHAPTER
—————————————————
0:00 Sort
1:26 Cache location
2:41 Vector traversal
4:39 Matrix multiplication
7:04 Predictability of branches
9:56 Branchless optimization
Please take the opportunity to connect with your friends and family and share this video with them if you find it useful.