Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.lang.pascal.misc > #768

To answer a questoin about my algorithms

Show all headers | View raw

vfclists wrote:
 >Hi,
 >I have noticed your regular updates >about your fair lock and other 
 >concurrency related issues and would >like to know what kind of areas 
they are >applicable to. Can you give me an idea of >what I might need 
something like that for?

 >Seeing these topics make me feel my >Computer Science knowledge is 
 >inadequate.

Jurassic Pork write:
 >hello Aminer,
 >have you seen  :o the vfclists 's question ? i >have the same


Read here:

http://forum.lazarus.freepascal.org/index.php/topic,24210.30.html



And my answer:


The concurrency area is very interresting, i will explain to you more 
some concepts so that you  understand my scalable synchronization 
algorithms..

For exemple when a mutating integer variable (a variable that change) is 
used  from multiple threads, the content of this variable have to be 
transfered from one core to another core, and this genrate cache-line 
transfer from one cor to the other, and this a cache-line transfer is 
expensive, so you have to optimize more your algorithm to reduce the 
number of variables that generate cache-line transfer cause those 
variables will generate more contention and will slow your algorithm, 
and if you are spin-waiting waiting for a specific content of a variable 
that is mutating you have to minimize efficienly the cache-coherence 
traffic, that means you have to do your best to transform your algorithm 
so that this spin-waiting on a specific content of a variable will 
generate less cache-line transfers, this is what is doing my algorithms, 
my algorithms of my scalable sychronization algorithms and my algorithms 
of  efficient concurrent FIFO queues are efficient in the sense that 
they reduce the cache coherence traffic and they use less variables that 
generate cache-line transfers.

My scalable array based Lock called AMLock is a scalable Lock, scalable 
in the sense that with more and more cores its throughput will not drop..

My scalable RWLock is a sacalable and fast 
Multiple-Readers-Exclusive-Writer Lock that works across processes and 
threads,
scalable means that the readers will be run in parallel , so you will 
get more performance by parallelizing the reader side, and the reader 
side is scalable and efficient.

My new algorithm of a very fast concurrent FIFO queue here:

http://pages.videotron.com/aminer/CQueue3.htm


It is a concurrent FIFO queue that uses less variables that generate 
cache-line transfers and it minimizes the cache-coherence traffic.


Please take a look at my other projects here:

http://pages.videotron.com/aminer/



Thank you,
Amine Moulay Ramdane.

Back to comp.lang.pascal.misc | Previous | Next | Find similar | Unroll thread

Thread

To answer a questoin about my algorithms aminer <aminer@toto.net> - 2014-05-06 21:31 -0700

csiph-web