Re:Faster than radix sort: Kirkpatrick-Reisch sorting
by naasking on Tuesday June 09, 2020 @08:53AM
(#23466194)
> I am not sure if any serious academic work has been built on this model, but it's a nice short hand.
Not that nmodel specifically, but cache-oblivious data structures are specifically designed to scale well in a hierarchical cache model, no matter the cache block size. So they scale excellently across L1 cache all the way down to hard disk.
Not that nmodel specifically, but cache-oblivious data structures are specifically designed to scale well in a hierarchical cache model, no matter the cache block size. So they scale excellently across L1 cache all the way down to hard disk.