ons 2010-06-16 klockan 10:09 +0200 skrev Kinkie:
> Actually the thing I found the most interesting is that it suggests to
> use page-aware object placements so that big structures traversal is
> easier on the VM.
The optimization he discusses is mainly to make the operation more
optimal in precen
2010/6/16 Kinkie :
> Actually the thing I found the most interesting is that it suggests to
> use page-aware object placements so that big structures traversal is
> easier on the VM. Could it be useful to adopt that for some of our
> low-level indexes? We do have a few hashes and trees laying aroun
>> Maybe there are some hints we could use..
>
> Useful, but not revolutionary.
Never claimed it was
> But yes, a VM based store has it's benefits, but for that to work for us
> a different design is needed more along the lines of Varnish, making
> heavy use of worker threads for mostly every ope
ons 2010-06-16 klockan 00:36 +0200 skrev Kinkie:
> What's your guys opinion about this article?
> It deals with some specific algorithms Varnish uses to increase
> performance to account for the fact that it's running under a
> real-world VM.
Yes.. quite expected result actually. Similar benefits
On Wed, 16 Jun 2010 10:45:00 +1200, Robert Collins
wrote:
> Well its written in an entertaining and a little condescending style.
> The class of algorithmic analysis that is relevant is 'cache oblivious
> algorithms' and is a hot topic at the moment.
>
> Well worth reading and thinking about.
>
Well its written in an entertaining and a little condescending style.
The class of algorithmic analysis that is relevant is 'cache oblivious
algorithms' and is a hot topic at the moment.
Well worth reading and thinking about.
-Rob
What's your guys opinion about this article?
It deals with some specific algorithms Varnish uses to increase
performance to account for the fact that it's running under a
real-world VM.
Maybe there are some hints we could use..
http://queue.acm.org/detail.cfm?id=1814327
--
/kinkie
