dmoldavanov

4 ms·

1. 1.▲
   by dmoldavanov 6y ago

   Cache-Oblivious B-Tree is a variant of B-Tree The title says "fundamentally new"
2. 2.▲
   by dmoldavanov 6y ago

   DPI Vendors: Belarus = Sandvine (USA) Kazakhstan = Allot (Israel)
3. 3.▲
   by dmoldavanov 7y ago

   They also have _comparison_ with RCU https://concurrencyfreaks.blogspot.com/2019/10/is-rcu-generi...
4. 4.▲
   by dmoldavanov 7y ago

   And now imaging an Operation System with hundreds or even thousands other processes at work.
5. 5.▲
   by dmoldavanov 7y ago

   >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
6. 6.▲
   by dmoldavanov 7y ago

   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.