3 Mar
2018
3 Mar
'18
1:57 p.m.
Have you implemented one in modern C++? And run comparative timings versus other map-like data structures on modern CPUs?
Skiplists were wicked fast in the 1990's, but with today's CPUs an in-memory BTree may be faster because of hardware caches. Very true. https://www.usenix.org/system/files/conference/fast18/fast18-hwang.pdf shows how poorly skip lists perform on modern CPUs.
Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/