Cache-Oblivious B-Tree is a variant of B-Tree The title says "fundamentally new"
DPI Vendors: Belarus = Sandvine (USA) Kazakhstan = Allot (Israel)
They also have _comparison_ with RCU https://concurrencyfreaks.blogspot.com/2019/10/is-rcu-generi...
And now imaging an Operation System with hundreds or even thousands other processes at work.
>Imagine you you have a text file or database with millions of numbers in ASCII hexadecimal notation These much amount of data with guarantee will crowd out this array from cache bcauz processor cache in not a LRU
Using of array lookup is a bad wayof optimization: digittoval[src[N]] can take up to 200 cycles if not in cache Only synthetic tests that small enough (most of them do nothing than tested code) show good results.
Cache-Oblivious B-Tree is a variant of B-Tree The title says "fundamentally new"
DPI Vendors: Belarus = Sandvine (USA) Kazakhstan = Allot (Israel)
They also have _comparison_ with RCU https://concurrencyfreaks.blogspot.com/2019/10/is-rcu-generi...
And now imaging an Operation System with hundreds or even thousands other processes at work.
>Imagine you you have a text file or database with millions of numbers in ASCII hexadecimal notation These much amount of data with guarantee will crowd out this array from cache bcauz processor cache in not a LRU
Using of array lookup is a bad wayof optimization: digittoval[src[N]] can take up to 200 cycles if not in cache Only synthetic tests that small enough (most of them do nothing than tested code) show good results.