Changes

Jump to: navigation, search

GPU621/Analyzing False Sharing

26 bytes added, 12:14, 23 November 2022
no edit summary
Or this
To our surprise, the serial block is took much less time-consuming, no matter how many times I ran it. This turns turned our existing knowledge upside down, but don't worry, it's because you havendon't understood understand False Sharing yet.
As we said above, the smallest unit of CPU operation on the cache is the size of a cache line, which is 64 bytes. As you can see in our program code, the sum is a vector that stores two long data types. The two long data are in fact located on the same cache line. When two threads read and write sum[0] and sum[1] separately, it looks like they are not using the same variable, but in fact, they are affecting each other.For example, if a thread updates sum[0] in CPU0, this causes the cache line of sum[1] in CPU1 to be invalidated. This causes the program to take longer to run, as it needs to re-read the data.
118
edits

Navigation menu