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

Groups > comp.programming.threads > #2759

More about scalability

Show all headers | View raw

Hello,


What i like about my scalable distributed sequential lock,
is that if for example you want to implement a really fast and
parallel in-memory database or a Parallel Redblack tree and a parallel
AVL tree, the reader section will be much expensive than the
writer section, cause in the writer side you first write
the data outside the writer section and inside the writer
section you just copy your pointer to the datastructure,
but in the reader section you have to read the data
from the memory from inside the reader section , that makes
the reader section more expensive , so from the Amdahl's
law this will make the parallel in-memory database
that uses my scalable distributed sequential lock to
scale very well(on NUMA etc.) or it will make the the parallel Redblack 
tree or parallel AVL tree that use my scalable distributed sequential 
lock to scale very well (on NUMA etc.).


That's very important to know.


Thank you,
Amine Moulay Ramdane,.

Back to comp.programming.threads | Previous | Next — Next in thread | Find similar | Unroll thread

Thread

More about scalability Ramine <ramine@1.1> - 2014-12-07 16:38 -0800
  Re: More about scalability Ramine <ramine@1.1> - 2014-12-07 17:10 -0800

csiph-web