Received: from localhost (unknown [200.46.204.183]) by postgresql.org (Postfix) with ESMTP id 544622E0188 for ; Tue, 29 Jan 2008 12:23:41 -0400 (AST) Received: from postgresql.org ([200.46.204.71]) by localhost (mx1.hub.org [200.46.204.183]) (amavisd-maia, port 10024) with ESMTP id 30696-10 for ; Tue, 29 Jan 2008 12:23:38 -0400 (AST) Received: from gwmta.wicourts.gov (gwmta.wicourts.gov [165.219.244.99]) by postgresql.org (Postfix) with ESMTP id 136512E0190 for ; Tue, 29 Jan 2008 12:23:37 -0400 (AST) Received: from Courts-MTA by gwmta.wicourts.gov with Novell_GroupWise; Tue, 29 Jan 2008 10:23:36 -0600 Message-Id: <479EFE9A.EE98.0025.0@wicourts.gov> X-Mailer: Novell GroupWise Internet Agent 7.0.2 Date: Tue, 29 Jan 2008 10:23:22 -0600 From: "Kevin Grittner" To: "Gregory Stark" , "Matthew" Cc: "Mark Mielke" , Subject: Re: RAID arrays and performance References: <87lk8aiqf3.fsf@oxford.xeocode.com> <475559F4.7060104@mark.mielke.cc> <4755648C.90905@mark.mielke.cc> <87bq96ii3b.fsf@oxford.xeocode.com> <4755810E.4000707@mark.mielke.cc> <87zlwq6yz9.fsf@oxford.xeocode.com> <87bq74vfys.fsf@oxford.xeocode.com> (matthew@flymine.org's message of "Tue\, 29 Jan 2008 15\:09\:03 +0000 \(GMT\)") <877ihsvdcb.fsf@oxford.xeocode.com> In-Reply-To: <877ihsvdcb.fsf@oxford.xeocode.com> Mime-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: quoted-printable Content-Disposition: inline X-Virus-Scanned: Maia Mailguard 1.0.1 X-Archive-Number: 200801/292 X-Sequence-Number: 28531 >>> On Tue, Jan 29, 2008 at 9:52 AM, in message <877ihsvdcb.fsf@oxford.xeocode.com>, Gregory Stark = wrote:=20 =20 > I got this from a back-of-the-envelope calculation which now that I'm = trying > to reproduce it seems to be wrong. Previously I thought it was n(n+1)/2 = or > about n^2/2. So at 16 I would have expected about 128 pending i/o = requests > before all the drives could be expected to be busy. =20 That seems right to me, based on the probabilities of any new request hitting an already-busy drive. =20 > Now that I'm working it out more carefully I'm getting that the expected > number of pending i/o requests before all drives are busy is > n + n/2 + n/3 + ... + n/n =20 What's the basis for that? =20 -Kevin =20