Hello,
I'm testing the scalability of memcached-1.4.20 version in a GET dominated
system.
For a linked-list traversal in a hash table (do_item_get), it is protected
by interleaved lock (per bucket),
so it showed very high scalability.
But, after linked-list traversal, LRU update is protected by
> On Jul 31, 2014, at 10:01 AM, Byung-chul Hong
> wrote:
>
> Hello,
>
> I'm testing the scalability of memcached-1.4.20 version in a GET dominated
> system.
> For a linked-list traversal in a hash table (do_item_get), it is protected by
> interleaved lock (per bucket),
> so it showed very h
Hello Dormando,
Thanks for the answer.
The LRU fiddling only happens once a minute per item, so hot items don't
affect the lock as much. The more you lean toward hot items the better it
scales as-is.
=> For linked-list traversal, pthreads acquire item-partitioned lock. But
threads acquire glob
> Hello Dormando,
> Thanks for the answer.
>
> The LRU fiddling only happens once a minute per item, so hot items don't
> affect the lock as much. The more you lean toward hot
> items the better it scales as-is.
> => For linked-list traversal, pthreads acquire item-partitioned lock. But
> threads
Thanks for the answer.
2014년 8월 4일 월요일 오후 2시 34분 10초 UTC+9, Dormando 님의 말:
>
> > Hello Dormando,
> > Thanks for the answer.
> >
> > The LRU fiddling only happens once a minute per item, so hot items don't
> affect the lock as much. The more you lean toward hot
> > items the better it scales