Return-Path: Received: (majordomo@vger.kernel.org) by vger.kernel.org via listexpand id ; Tue, 11 Mar 2003 02:37:46 -0500 Received: (majordomo@vger.kernel.org) by vger.kernel.org id ; Tue, 11 Mar 2003 02:37:46 -0500 Received: from holomorphy.com ([66.224.33.161]:49848 "EHLO holomorphy") by vger.kernel.org with ESMTP id ; Tue, 11 Mar 2003 02:37:45 -0500 Date: Mon, 10 Mar 2003 23:47:12 -0800 From: William Lee Irwin III To: "Martin J. Bligh" Cc: Andi Kleen , linux-kernel Subject: Re: Dcache hash distrubition patches Message-ID: <20030311074712.GG20188@holomorphy.com> Mail-Followup-To: William Lee Irwin III , "Martin J. Bligh" , Andi Kleen , linux-kernel References: <10280000.1047318333@[10.10.2.4]> <20030310175221.GA20060@averell> <26350000.1047368465@[10.10.2.4]> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: <26350000.1047368465@[10.10.2.4]> User-Agent: Mutt/1.3.28i Organization: The Domain of Holomorphy Sender: linux-kernel-owner@vger.kernel.org X-Mailing-List: linux-kernel@vger.kernel.org Content-Length: 938 Lines: 22 On Mon, Mar 10, 2003 at 11:41:07PM -0800, Martin J. Bligh wrote: > It's not perfect, but not bad either. Some mathematician can go calculate > just how imperfect it is over random distribution, but it looks OK to me ;-) Okay, the standards are a bit more stringent for hash functions. You basically want the total number of collisions to be minimized. That said, standard statistical things are useful for first-pass discrimination. This looks basically okay, but if it's really just even with respect to cache pressure the need for a different data structure in the eventual future is clear. I'd need a baseline (pre-hlist) dcache snapshot to compare against to get a better idea. -- wli - 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/