Hello...
As you have noticed i have implemented a concurrent Skiplist, the interface of my concurrent Skiplist is very fexible, and as you have noticed i am using one distributed reader-writer mutex to implement my concurrent algorithm, so i am not using RCU or SMR or VZoom, so i have done a scalability prediction for this algorithm, and i have noticed that on a 32 NUMA nodes computer and 50 millions of read , write and delete requests, with a workload of 0.5% of writes and ~99% of reads, it will give a throughput of 50 millions request per 10 seconds , that's cool. On a non-NUMA Quadcore it will give 4X scalability. You can download my new concurrent Skiplist version 1.02 from: https://sites.google.com/site/aminer68/concurrent-skiplist Thank you, Amine Moulay Ramdane. -- --- You received this message because you are subscribed to the Google Groups "Scalable Synchronization Algorithms" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/lock-free/d4bfdad2-3b66-4a78-b2d5-29f2e55d05c2%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
