[lkml]   [2013]   [Jan]   [17]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: [PATCH 09/19] list_lru: per-node list infrastructure
On 01/17/2013 04:10 PM, Dave Chinner wrote:
> and we end up with:
> lru_add(struct lru_list *lru, struct lru_item *item)
> {
> node_id = min(object_to_nid(item), lru->numnodes);
> __lru_add(lru, node_id, &item->global_list);
> if (memcg) {
> memcg_lru = find_memcg_lru(lru->memcg_lists, memcg_id)
> __lru_add_(memcg_lru, node_id, &item->memcg_list);
> }
> }

A follow up thought: If we have multiple memcgs, and global pressure
kicks in (meaning none of them are particularly under pressure),
shouldn't we try to maintain fairness among them and reclaim equal
proportions from them all the same way we do with sb's these days, for

I would argue that if your memcg is small, the list of dentries is
small: scan it all for the nodes you want shouldn't hurt.

if the memcg is big, it will have per-node lists anyway.

Given that, do we really want to pay the price of two list_heads in the

 \ /
  Last update: 2013-01-18 02:21    [W:0.072 / U:0.064 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site