A concurrent Skiplist version 1.1

[Amine Moulay Ramdane]

Hello,


I have updated my concurrent Skiplist to version 1.1

I have enhanced it more and its interface is very flexible and complete,  and now i have added a third boolean parameter to the constructor, when this parameter is true the concurrent Skiplist will insert elements that are duplicated, when it's false it will not duplicate, also the size of the concurrent Skiplist is now an unsigned 64 bit integer, i have also corrected a bug, and i have thoroughly tested it and it is now working well, i have also included a new test example called test_all.pas in the zip file , please look at it and learn from it..

Description:

I propose a new concurrent skip list algorithm distinguished by a combination of simplicity and scalability. This parallel algorithm makes the search() method scalable and it makes the insert() method of a decent throughput. This parallel algorithm employs one distributed reader-writer mutex that makes the search() method scales to 250X on NUMA architecture and on multicores, unlike some other concurrent skip list algorithms, this algorithm preserves the skiplist properties at all times, which facilitates reasoning about its correctness. Experimental evidence shows that this parallel algorithm performs well.


You can download my new concurrent skiplist version 1.1 from:

https://sites.google.com/site/aminer68/concurrent-skiplist




Thank you,
Amine Moulay Ramdane.