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

Groups > comp.programming.threads > #1205

Re: Now where can you use my ParallelSort library ?

Cross-posted to 2 groups.

Show all headers | View raw

Hello again,

But why use my Parallel Hashlist(parallel hashtable) for exemple  as an 
in-memory database server  ?


Read this:

"A parallel HashList with O(1) best case and O(log(n)) worst case access 
that uses lock striping and lightweight 
MREWs(multiple-readers-exclusive-writer) , this allows multiple threads to 
write and read concurently. also parallelhashlist maintains an independant 
counter , that counts the number of entries , for each segment of the 
hashtable and uses a lock for each counter, this is also for better 
scalability."

Cause it allows multiple threads to write and read concurently,
and it scales very well.


You can download Parallel Hashlist and Parallel Sort library
from:

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


Thank you,
Amine Moulay Ramdane.





"aminer" <aminer@toto.com> wrote in message 
news:k6s3v0$q15$1@dont-email.me...
>
> Hello,
>
> Now  where can you use my ParallelSort library ?
>
> You can use it for exemple if you want to implement an in-memory database
> with my Parallel Hahslist(parallel hashtable), so if you want to do for 
> exemple
> an SQL  Select like this (or another SQL select):
>
> select  name
> from titles
> where  price  < 50
>
> You can construct the titles table withParallel hashlist(of course you can 
> add
> more than one table to parallel hashlist), and copy this table in an array 
> and
> after that sort the array in parallel on the price key with my parallel 
> sort library ,
> and after that use a binary search function to find the prices in the 
> array that are
> lower than 50.
>
> This is how you can use Parallel Sort library and Parallel Hashlist as 
> in-memory database,
> and of course you have to use TCP/IP to be able to use Parallel Hahslist 
> as an in-memory database
> server.
>
> I have exported the two functions binsearch() and binsearch1() from 
> Parallel Sort library.
>
> You can download ParallelSort library and parallel hashlist from:
>
> http://pages.videotron.com/aminer/
>
>
>
> Amine Moulay Ramdane.
>
>
>
>
>
>
>
> 

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

Thread

Now where can you use my ParallelSort library ? "aminer" <aminer@toto.com> - 2012-10-31 17:08 -0500
  Re: Now where can you use my ParallelSort library ? "aminer" <aminer@toto.com> - 2012-10-31 17:23 -0500
  Re: Now where can you use my ParallelSort library ? "aminer" <aminer@toto.com> - 2012-10-31 17:31 -0500
  Re: Now where can you use my ParallelSort library ? "aminer" <aminer@toto.com> - 2012-10-31 17:41 -0500
  Re: Now where can you use my ParallelSort library ? "aminer" <aminer@toto.com> - 2012-10-31 18:16 -0500
  Re: Now where can you use my ParallelSort library ? "aminer" <aminer@toto.com> - 2012-10-31 18:33 -0500

csiph-web