From: | Hiroshi Inoue <Inoue(at)tpf(dot)co(dot)jp> |
---|---|
To: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
Cc: | "Schmidt, Peter" <peter(dot)schmidt(at)prismedia(dot)com>, pgsql-hackers(at)postgresql(dot)org, pgsql-admin(at)postgresql(dot)org |
Subject: | Re: [HACKERS] Re: v7.1b4 bad performance |
Date: | 2001-02-19 23:28:47 |
Message-ID: | 3A91AC2F.3471A74@tpf.co.jp |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-admin pgsql-hackers |
Tom Lane wrote:
>
> Hiroshi Inoue <Inoue(at)tpf(dot)co(dot)jp> writes:
> > In your test cases I always see "where bid = 1" at "update branches"
> > i.e.
> > update branches set bbalance = bbalance + ... where bid = 1
>
> > ISTM there's no multiple COMMIT in your senario-s due to
> > their lock conflicts.
>
> Hmm. It looks like using a 'scaling factor' larger than 1 is necessary
> to spread out the updates of "branches". AFAIR, the people who reported
> runs with scaling factors > 1 got pretty much the same results though.
>
People seem to believe your results are decisive
and would raise your results if the evidence is
required.
All clients of pgbench execute the same sequence
of queries. There could be various conflicts e.g.
oridinary lock, buffer lock, IO spinlock ...
I've been suspicious if pgbench is an (unique)
appropiriate test case for evaluaing commit_delay.
Regards,
Hiroshi Inoue
From | Date | Subject | |
---|---|---|---|
Next Message | Tom Lane | 2001-02-19 23:40:45 | Re: [HACKERS] Re: v7.1b4 bad performance |
Previous Message | Tom Lane | 2001-02-19 17:15:03 | Re: [HACKERS] Re: v7.1b4 bad performance |
From | Date | Subject | |
---|---|---|---|
Next Message | Tom Lane | 2001-02-19 23:36:03 | Ordering problem with --with-includes |
Previous Message | Tom Lane | 2001-02-19 23:08:24 | enable-debug considered pointless |