4 ms·
It's also powerful to think of these numbers in the context of complexity. You might not worry about a nanosecond here or there in an O(N) algorithm, but at O(
by pacaro 10y ago
It's also powerful to think of these numbers in the context of complexity. You might not worry about a nanosecond here or there in an O(N) algorithm, but at O(N^3), when N is 100 each nanosecond in the inner loop is a millisecond of wall clock. Blowing the cache in that inner loop is going to hurt
- R_haterade 10y agoCan confirm. Currently scrambling to finish up code for school, and the additional synchronization involved in false-sharing is killing me.