{"id":955,"date":"2020-11-22T23:47:17","date_gmt":"2020-11-22T15:47:17","guid":{"rendered":"https:\/\/markjohntaylor.com\/blog\/wordpress\/?p=955"},"modified":"2021-01-11T18:56:24","modified_gmt":"2021-01-11T10:56:24","slug":"memory-cpu-caches","status":"publish","type":"post","link":"https:\/\/markjohntaylor.com\/blog\/wordpress\/index.php\/2020\/11\/22\/memory-cpu-caches\/","title":{"rendered":"Memory & CPU Caches"},"content":{"rendered":"\n

This week and last weekend I was primarily focusing on memory pools, allocators, CPU caches. I now probably know how allocators work, simply separating memory allocation & objects initialization, for example, reserve() function in std::vector, it doesn’t initialize the allocated data segment, thus permitting better performance when we don’t need initialize the data immediately. <\/p>\n\n\n\n

CPU cache is another very interesting & important aspect that can (hugely) influence the performance of our programs, as it’s way faster than main memory (RAM). Smaller is faster. A great resource I found on Tuesday evening was a YouTube video – Scott Meyers’s presentation on code::drive conference 2014<\/a>, a very humorous & high-quality speech!! Really awesome!<\/p>\n\n\n\n

Here are a few slides screenshots, the complete presentation pdf version can be downloaded from here<\/a>.<\/p>\n\n\n\n