Beating the L1 cache with value speculation (2021)
1–10 of 87 posts
Re: Beating the L1 cache with value speculation (2021)
#2[deleted]
Re: Beating the L1 cache with value speculation (2021)
#3The nodes are adjacent.
Re: Beating the L1 cache with value speculation (2021)
#4[flagged]
Re: Beating the L1 cache with value speculation (2021)
#5The article states that the CPU has a limit of 4 instructions per cycle, but the sum2 method issues 5 instructions per cycle. Presumably one of them (maybe the increment) is trivial enough to be executed as a fifth instruction.
Re: Beating the L1 cache with value speculation (2021)
#6Neat trick. Though it seems unlikely to be very useful in practice. How often are you going to know the probably value of a pointer without knowing the actual value? I would guess it's pretty rare. Interesting anyway!
Re: Beating the L1 cache with value speculation (2021)
#7I appreciate the elegant blog design. Reminds me of Edward Tufte's books.
Re: Beating the L1 cache with value speculation (2021)
#8[deleted]
Re: Beating the L1 cache with value speculation (2021)
#9[deleted]
[deleted]
Re: Beating the L1 cache with value speculation (2021)
#10Neat trick. Though it seems unlikely to be very useful in practice. How often are you going to know the probably value of a pointer without knowing the actual value? I would guess it's pretty rare. Interesting anyway!
It might be useful in cases where you pre-allocate a large array which you don't randomly access and whose structure doesn't change much but sometimes it does. Then you could either reallocate the array and pay a (large) one time cost or use this trick.