A concurrent SkipList version 1.02

[Ramine]

Hello,


A concurrent SkipList version 1.02

I have updated my concurrent Skiplist , i have just corrected a bug
inside the next() method, now when you want to call next() method to get
a sorted list, please call the Enter() method before getting the sorted
list with the next() method and call the Leave() method after you get
the sorted list, please look at how to do it by looking at the test
examples inside the zip file.

Authors: Amine Moulay Ramdane (Based on Duncan Murdoch's sequential
Skiplist)


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 concurrent Skiplist version 1.02 from:

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




Thank you,
Amine Moulay Ramdane.