Sequential I/O Cost (was Re: A Better External Sort?)

From: "Jeffrey W(dot) Baker" <jwbaker(at)acm(dot)org>
To: Ron Peacetree <rjpeace(at)earthlink(dot)net>
Cc: pgsql-performance(at)postgresql(dot)org
Subject: Sequential I/O Cost (was Re: A Better External Sort?)
Date: 2005-09-29 04:33:46
Message-ID: 1127968426.8954.19.camel@noodles
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers pgsql-performance

On Wed, 2005-09-28 at 12:03 -0400, Ron Peacetree wrote:
> >From: "Jeffrey W. Baker" <jwbaker(at)acm(dot)org>
> >Perhaps I believe this because you can now buy as much sequential I/O
> >as you want. Random I/O is the only real savings.
> >
> 1= No, you can not "buy as much sequential IO as you want". Even if
> with an infinite budget, there are physical and engineering limits. Long
> before you reach those limits, you will pay exponentially increasing costs
> for linearly increasing performance gains. So even if you _can_ buy a
> certain level of sequential IO, it may not be the most efficient way to
> spend money.

This is just false. You can buy sequential I/O for linear money up to
and beyond your platform's main memory bandwidth. Even 1GB/sec will
severely tax memory bandwidth of mainstream platforms, and you can
achieve this rate for a modest cost.

I have one array that can supply this rate and it has only 15 disks. It
would fit on my desk. I think your dire talk about the limits of
science and engineering may be a tad overblown.

In response to

Browse pgsql-hackers by date

  From Date Subject
Next Message Thomas Hallgren 2005-09-29 06:17:15 Re: Server process exited with unexpected status 128.
Previous Message Jeffrey W. Baker 2005-09-29 04:27:20 Re: [PERFORM] A Better External Sort?

Browse pgsql-performance by date

  From Date Subject
Next Message Dennis Bjorklund 2005-09-29 05:38:38 Re: Comparative performance
Previous Message Jeffrey W. Baker 2005-09-29 04:27:20 Re: [PERFORM] A Better External Sort?