From owner-freebsd-chat Sun Jan 27 15:21:30 2002 Delivered-To: freebsd-chat@freebsd.org Received: from scaup.prod.itd.earthlink.net (scaup.mail.pas.earthlink.net [207.217.120.49]) by hub.freebsd.org (Postfix) with ESMTP id EF42B37B400 for ; Sun, 27 Jan 2002 15:21:26 -0800 (PST) Received: from pool0437.cvx22-bradley.dialup.earthlink.net ([209.179.199.182] helo=mindspring.com) by scaup.prod.itd.earthlink.net with esmtp (Exim 3.33 #1) id 16Uybl-00023N-00; Sun, 27 Jan 2002 15:21:10 -0800 Message-ID: <3C548B60.8FA53D8C@mindspring.com> Date: Sun, 27 Jan 2002 15:21:04 -0800 From: Terry Lambert X-Mailer: Mozilla 4.7 [en]C-CCK-MCD {Sony} (Win98; U) X-Accept-Language: en MIME-Version: 1.0 To: Brad Knowles Cc: "Matthew D. Fuller" , Mike Meyer , chip , freebsd-chat@freebsd.org Subject: Re: Bad disk partitioning policies (was: "Re: FreeBSD Intaller(was "Re: ... RedHat ...")") References: <20020123124025.A60889@HAL9000.wox.org> <3C4F5BEE.294FDCF5@mindspring.com> <20020123223104.SM01952@there> <15440.35155.637495.417404@guru.mired.org> <15440.53202.747536.126815@guru.mired.org> <15441.17382.77737.291074@guru.mired.org> <20020125212742.C75216@over-yonder.net> <3C526D0F.A27A59E7@mindspring.com> Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-freebsd-chat@FreeBSD.ORG Precedence: bulk List-ID: List-Archive: (Web Archive) List-Help: (List Instructions) List-Subscribe: List-Unsubscribe: X-Loop: FreeBSD.org Brad Knowles wrote: > > Donald Knuth, "Seminumerical Algorithms: Sorting and Searching". > > I am probably one of the few people on this list who has > actually used this book, and I still have my copy from fifteen years > ago somewhere around the house. I even recall trying to grok the MIX > assembly code. If you can provide an exact page reference, I would > appreciate it. Searching. Section 6.4. > > 85% of load is the point at which a perfect hash starts getting > > collisions from random data with a probabiliy of higher than 1.005. > > I believe that this assumes that the hash buckets are a > consistent size relative to the overall capacity. However, as the > overall capacity grows by orders of magnitude, I believe that this > generalization fails to deal with the relative logarithmic size of > the hash buckets. You are correct about the assumption. The "hashing" is into the cylinder groups, which are a fixed capacity, which doesn't change. If the selection of cylinder group were done that way, too, then you'd have a point, but it's not. -- Terry To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe freebsd-chat" in the body of the message