I think in order to really reap the benefits of this you'll want to actually reorganize the in-memory layout of the trees in order to make sure all elements needed for the comparison end up in the same cache line.
I haven't been following this closely, but the last time I checked scatter-gather loads were really really slow.
Chapter 3.3 from page 27 (PDF page 43) on of this be interesting: https://www.researchgate.net/profile/Florian_Gross/publicati...
Also contains a survey of some other related data structures and algorithms.