Wednesday, October 29, 2014

Digest for comp.programming.threads@googlegroups.com - 7 updates in 2 topics

comp.programming.threads@googlegroups.com Google Groups
Unsure why you received this message? You previously subscribed to digests from this group, but we haven't been sending them for a while. We fixed that, but if you don't want to get these messages, send an email to comp.programming.threads+unsubscribe@googlegroups.com.
Ramine <ramine@1.1>: Oct 28 05:54PM -0700

Hello,
 
 
If you look at Java or Delphi , then if you use persitant objects , i
think you have to save them manually to the hardisk file, but my
Parallel Varfiler is more powerful cause it can save automaticaly
to hardisk file each key and its corresponding data that you write to
the hashtable , and as i have said my Parallel Varfiler don't use a
single RWLock around the Hashtable, but it is more powerful cause it is
more fine grained cause it uses lock striping and an RWLock for each
bucket of the hashtable, so it's more scalable and fast.
 
So you have to take a look at my Parallel Varfiler and its programming
interface that is easy to use.
 
Thank you,
Amine Moulay Ramdane.
Ramine <ramine@1.1>: Oct 28 06:04PM -0700

I wrote:
 
>but my Parallel Varfiler is more powerful cause it can save
>automaticaly to hardisk file each key and its corresponding data that
>you write to the hashtable ,
 
 
And when you delete or update a key an it's correponding my Parallel
Varfiler will do it automaticaly for each key , so it's more powerful
than persistant objects that you have to save manually to the hardisk,
and Parallel Varfiler supports variants and streams, so all in all
Parallel Varfiler is an interesting tool i think.
 
 
Thank you,
Amine Moulay Ramdane.
Ramine <ramine@1.1>: Oct 28 05:00PM -0700

Hello,
 
 
My Parallel Varfiler was ported to Delphi XE versions,
so now it's working with all the Delphi versions and
also with FreePascal.
 
 
Please note that Parallel Varfiler is more powerful
than a persistant parallel Hashtable, cause it can also save
automaticaly your parallel Hashtable to the hardisk
or it can also work from memory and it's a parallel hashtable
that works with variants and with streams etc.
 
 
You can read more about Parallel Varfiler and download it from my google
site here:
 
https://sites.google.com/site/aminer68/parallel-varfiler
 
 
there is two zipfiles to download, one for Delphi XE versions called
"parallelvarfiler_xe.zip" and another one for FreePascal
and Delphi 7 to 2007 called "parallelvarfiler.zip"...
 
 
 
 
 
Thank you,
Amine Moulay Ramdane.
Ramine <ramine@1.1>: Oct 28 05:08PM -0700

Hello,
 
 
When there is collisions in the hashtable , the average time complexity
will be O(log(n)) in each bucket were the collisions happened.
 
 
To compile it please use the define options: -DDelphi
 
 
 
Thank you,
Amine Moulay Ramdane.
Ramine <ramine@1.1>: Oct 28 05:19PM -0700

Hello,
 
When there is collisions in the parallel hashtable , the average time
complexity will be O(log(n)) in each bucket were the collisions happened.
 
The average time complexity is O(log(n)) in each bucket were the
collisions happened, cause i am using a binary tree in each bucket of
the hashtable, and the best case time complexity is O(1) , so it's more
than a parallel hashtable that is really fast.
 
 
Thank you,
Amine Moulay Ramdane.
Ramine <ramine@1.1>: Oct 28 05:29PM -0700

Hello,
 
 
My Parallel Varfiler is not using RWLock, it's using a more fine grained
locking mechanism that we call lock striping and using RWLock in each
bucket of the hashtable , so it is really scalable and fast.
 
 
 
Thank you,
Amine Moulay Ramdane.
Ramine <ramine@1.1>: Oct 28 05:51PM -0700

Hello,
 
 
If you look at Java or Delphi , then if you use persitant objects , i
think you have to save them manually to the hardisk file, but my
Parallel Varfiler is more powerful cause it can save automaticalyto
hardisk file each key and its corresponding data that you write to the
hashtable , and as i have said my Parallel Varfiler don't use a single
RWLock around the Hashtable, but it is more powerful cause it is more
fine grained cause it uses lock striping and an RWLock for each bucket
of the hashtable, so it's more scalable and fast.
 
 
So you have to take a look at my Parallel Varfiler and its programming
interface that is easy to use.
 
 
 
 
Thank you,
Amine Moulay Ramdane.
You received this digest because you're subscribed to updates for this group. You can change your settings on the group membership page.
To unsubscribe from this group and stop receiving emails from it send an email to comp.programming.threads+unsubscribe@googlegroups.com.

No comments: