Ramine
3/18/2015 12:48:00 AM
Hello,
As you have seen me talking in my previous post, i have explained to
you a very important thing, but we have to be smarter than that to
be able to see clearly the overall picture, as you have noticed
researchers are inventing transactional memory, but transactional memory
and my SeqlockX are optimistic mechanisms, this means that you
can not always use transactional memory in a high level way,
for example with AVL trees and Red-black trees and Skiplists,
transactional memory can not be used in a high level way because
the writers can modify the pointers and this can raise exceptions
inside the readers and inside writers, and you can not do it
from high level around the insert() and search() and delete() because
you have to respect the logic of the sequential algorithms, that's
the same with my SeqlockX, you have to use them in this situation in
a finer grained manner from inside the insert() and delete() and
search() of the algorithms... this is the problem with optimistic
mechanisms of transactional memory and my SeqlockX and SMR and RCU
have the same problem... but with the scalable reader-writer locks you
can reason in a high level manner and put the Rlock() RUnlock() and
WLock() and WUnlock() in a straight forward manner around the insert()
and search() and delete() of the AVL tree or Red-Black tree or the
Skiplist, that's the advantage with scalable read-writer locks.
Thank you,
Amine Moulay Ramdane.