Return-Path: Received: (majordomo@vger.kernel.org) by vger.kernel.org via listexpand id ; Tue, 11 Dec 2001 18:27:35 -0500 Received: (majordomo@vger.kernel.org) by vger.kernel.org id ; Tue, 11 Dec 2001 18:27:25 -0500 Received: from rj.SGI.COM ([204.94.215.100]:18913 "EHLO rj.sgi.com") by vger.kernel.org with ESMTP id ; Tue, 11 Dec 2001 18:27:18 -0500 Date: Tue, 11 Dec 2001 15:27:35 -0800 From: Paul Jackson To: Jack Steiner cc: Dipankar Sarma , Niels Christiansen , kiran@linux.ibm.com, lse-tech@lists.sourceforge.net, linux-kernel@vger.kernel.org Subject: Re: [Lse-tech] [RFC] [PATCH] Scalable Statistics Counters In-Reply-To: <200112091734.LAA45393@fsgi055.americas.sgi.com> Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: linux-kernel-owner@vger.kernel.org X-Mailing-List: linux-kernel@vger.kernel.org On Sun, 9 Dec 2001, Jack Steiner wrote: > If code want to allocate close to a cpu, then kmem_cache_alloc_cpu() > is the best choice. However, I would also expect that some code > already knows the node. Then kmem_cache_alloc_node() is best. yup. > As precident, the page allocation routines are all node-based. > (ie., alloc_pages_node(), etc...) My inclinations would be to prefer more cpu-based allocators. But until I happen to catch you in a room with a white board, my inclinations are unlikely to go anywhere ... perhaps someday. I won't rest till it's the best ... Manager, Linux Scalability Paul Jackson 1.650.933.1373 - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/