Have you looked at this 2015 thesis which addresses lock-free memory management and new Chunk and Freeze techniques. Particularly the chapter 6 summary.
"Multi-Threaded Coordination Methods for Constructing Non-blocking Data Structures" http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-get.cgi/2015/PHD/PHD-2015-11.pdf On Mon, Aug 3, 2015 at 2:25 PM, Amine Moulay Ramdane <[email protected]> wrote: > a key , you search for it in my Scalable Parallel HashList or my Scalable > Parallel Varfiler, and when you want to > get the sorted list you can get it easily from the parallel > skiplist above.. this way you can get both of the charracteristic of my > scalable Hashtable and the charracteristic of my Parallel Skiplist.But when > you are using numbers, you can simply use a my parallel skiplist above and > you have to not worry about scalability , because when you are using > numbers since the compare function of two number that you find on a > Parallel Hahtable or a Parallel Skiplist takes very few CPU cycles , so it > will not get a good scalability. > -- --- 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/CALV1V4_pw2um_qyiZEPqCOUBXYGpH%3DDzxzN%2Bs99iztEKMUSisQ%40mail.gmail.com. For more options, visit https://groups.google.com/d/optout.
