l Message -
>> > From: Li Pi
>> > To: dev@hbase.apache.org
>> > Cc:
>> > Sent: Monday, October 24, 2011 11:27 PM
>> > Subject: Re: CSLM performance Was: SILT - nice keyvalue store paper
>> >
>> > You might also want to run the code a few
No. The problem is that you want to emulate real-world behavior which is
probably closer to 1000 threads each doing a single transaction and yielding
than anything else. For instance, if your traffic originates from a
web-farm, each transaction will be in a thread that yields when it finishes
the
y hitting back. - Piet Hein
> (via Tom White)
>
>
> - Original Message -
> > From: Li Pi
> > To: dev@hbase.apache.org
> > Cc:
> > Sent: Monday, October 24, 2011 11:27 PM
> > Subject: Re: CSLM performance Was: SILT - nice keyvalue store paper
&
day, October 24, 2011 11:27 PM
> Subject: Re: CSLM performance Was: SILT - nice keyvalue store paper
>
> You might also want to run the code a few times, and only take results
> from the latter half. Let the JVM warm up and JIT things for a fair
> comparison.
>
> On Mon, Oct
You might also want to run the code a few times, and only take results
from the latter half. Let the JVM warm up and JIT things for a fair
comparison.
On Mon, Oct 24, 2011 at 11:14 PM, Akash Ashok wrote:
> On Mon, Oct 24, 2011 at 10:49 PM, Ted Yu wrote:
>
>> Akash:
>> Take a look at the followin
On Mon, Oct 24, 2011 at 10:49 PM, Ted Yu wrote:
> Akash:
> Take a look at the following two possible replacements for CSLM:
> https://github.com/mspiegel/lockfreeskiptree
> https://github.com/nbronson/snaptree
Thanks Ted :) :) :). Was pretty much on the lookout for other structures. I
tried
http
Akash:
Take a look at the following two possible replacements for CSLM:
https://github.com/mspiegel/lockfreeskiptree
https://github.com/nbronson/snaptree
About your test, I got advice from other expert:
- the JVM warm-up penalty is being accrued by the CSLM run
- Use thread.yield() to end a reque
