Hello,


About Wait-free and Lock-free and about OneFile..

I am a white arab, and i think i am smart like a "genius",
since i have invented many scalable algorithms and there
implementations, and today i will make you understand more:

Look at this new invention of a PhD researcher:

OneFile - The world's first wait-free Software Transactional Memory

http://concurrencyfreaks.blogspot.com/2019/04/onefile-worlds-first-wait-free-software.html

And look carefully at this video about it by its inventor:

Pedro Ramalhete — Wait-free data structures and wait-free transactions

https://www.youtube.com/watch?v=oDfr9w9p8XY

So i think that this invention is not so smart, because
i have just read its source code here:

https://github.com/pramalhe/OneFile/blob/master/stms/OneFileWF.hpp

And it says the following:

Progress condition of the readers transactions: wait-free (bounded by
the number of threads + MAX_READ_TRIES)

and:

The progress condition of the writers transactions: wait-free (bounded
by the number of threads)

1- So as you are noticing it has a weakness and it is the same as the
Lock-free one, and it is that it wastes CPU time on the Progress
condition, so this wasting time is not good for scalability and
it is then not good for parallel programming, because so that it
"generalizes", it has also to work correctly not only for the much more read-mostly but also for other cases where the writes transactions are
of more greater proportion "relative" to the whole of the readers and
writers transactions, so my scalable and fair lock-based read-write
locks are better in this regard, since read about my new invention below
of of the Holy Grail of locks that i will use, and 'you will notice that
it is powerful.

2- Second weakness of the above invention, is that is is a complex
algorithm and this complexity of it is not good, and i think that
lock-based algorithms are much simpler , so they are easy to think about
and to implement.

I have invented a scalable algorithm that is a scalable fast Mutex that
is remarkable and that is the Holy Grail of scalable Locks, it has the following characteristics, read my following thoughts to understand:

About fair and unfair locking..

I have just read the following lead engineer at Amazon:

Highly contended and fair locking in Java

https://brooker.co.za/blog/2012/09/10/locking.html

So as you are noticing that you can use unfair locking that can have
starvation or fair locking that is slower than unfair locking.

I think that Microsoft synchronization objects like the Windows critical section uses unfair locking, but they still can have starvation.

But i think that this not the good way to do, because i am an inventor
and i have invented a scalable Fast Mutex that is much more powerful ,
because with my scalable Fast Mutex you are capable to tune the
"fairness" of the lock, and my Fast Mutex is capable of more than that,
read about it on my following thoughts:

More about research and software development..

I have just looked at the following new video:

Why is coding so hard...

https://www.youtube.com/watch?v=TAAXwrgd1U8

I am understanding this video, but i have to explain my work:

I am not like this techlead in the video above, because i am also an
"inventor" that has invented many scalable algorithms and there
implementions, i am also inventing effective abstractions, i give you an example:

Read the following of the senior research scientist that is called Dave
Dice:

Preemption tolerant MCS locks

https://blogs.oracle.com/dave/preemption-tolerant-mcs-locks

As you are noticing he is trying to invent a new lock that is preemption tolerant, but his lock lacks some important characteristics, this is why
i have just invented a new Fast Mutex that is adaptative and that is
much much better and i think mine is the "best", and i think you will
not find it anywhere, my new scalable Fast Mutex has the following characteristics:

1- Starvation-free
2- Tunable fairness
3- It keeps efficiently and very low its cache coherence traffic
4- Very good fast path performance
5- And it has a good preemption tolerance.
6- It is faster than scalable MCS lock
7- Not prone to convoying.



Thank you,
Amine Moulat Ramdane.

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)