From: | Luke Lonergan <llonergan(at)greenplum(dot)com> |
---|---|
To: | Simon Riggs <simon(at)2ndquadrant(dot)com> |
Cc: | <pgsql-performance(at)postgresql(dot)org> |
Subject: | Re: Benchmark Data requested |
Date: | 2008-02-04 22:32:21 |
Message-ID: | C3CCD275.52C9A%llonergan@greenplum.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-performance |
Hi Simon,
On 2/4/08 11:07 AM, "Simon Riggs" <simon(at)2ndquadrant(dot)com> wrote:
>> "executor-executor" test and we/you should be sure that the PG planner has
>> generated the best possible plan.
>
> If it doesn't then I'd regard that as a performance issue in itself.
Agreed, though that's two problems to investigate - I think the Monet/X100
stuff is clean in that it's a pure executor test.
> You maybe right, but I want to see where it hurts us the most.
You'll see :-)
>> The only way to cure this is to work on more rows than one at a time.
>
> Do you have any results to show that's true, or are you just referring
> to the Cray paper? (Which used fixed length tuples and specific vector
> hardware).
No paper referenced, just inference from the results and their (and others)
conclusions about locality and re-use. It's a similar enough situation to
scientific programming with vector processors versus cache based superscalar
that these are the right conclusions. We've done the profiling to look at
cache misses and have some data to back it up as well.
> (With regard to benchmarks, I'd rather not download Monet at all. Helps
> avoid legal issues around did-you-look-at-the-code questions.)
None of us have looked at the code or downloaded it. There are a number of
presentations out there for Monet/X100 to see what their results are.
- Luke
From | Date | Subject | |
---|---|---|---|
Next Message | Jignesh K. Shah | 2008-02-04 22:33:34 | Re: Benchmark Data requested |
Previous Message | Simon Riggs | 2008-02-04 20:21:56 | Re: Benchmark Data requested |