| From: | Alvaro Herrera <alvherre(at)2ndquadrant(dot)com> |
|---|---|
| To: | Mengxing Liu <liu-mx15(at)mails(dot)tsinghua(dot)edu(dot)cn> |
| Cc: | kgrittn <kgrittn(at)gmail(dot)com>, "pgsql-hackers(at)postgresql(dot)org" <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | Re: Re: [GSOC 17] Eliminate O(N^2) scaling from rw-conflict tracking in serializable transactions |
| Date: | 2017-06-02 15:08:46 |
| Message-ID: | 20170602150846.a66dhsfnsru7fau5@alvherre.pgsql |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
Mengxing Liu wrote:
> Hi, Alvaro and Kevin.
>
> > Anyway, this is just my analysis.
> > So I want to hack the PG and count the conflict lists' size of transactions. That would be more accurate.
>
> In the last week, I hacked the PG to add an additional thread to count RWConflict list lengths.
> And tune the benchmark to get more conflict. But the result is still not good.
Kevin mentioned during PGCon that there's a paper by some group in
Sydney that developed a benchmark on which this scalability problem
showed up very prominently. I think your first step should be to
reproduce their results -- my recollection is that Kevin says you
already know that paper, so please dedicate some time to analyze it and
reproduce their workload.
--
Álvaro Herrera https://www.2ndQuadrant.com/
PostgreSQL Development, 24x7 Support, Remote DBA, Training & Services
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Andres Freund | 2017-06-02 15:32:17 | Re: Do we need the gcc feature "__builtin_expect" to promote the branches prediction? |
| Previous Message | Tom Lane | 2017-06-02 15:02:48 | Re: Perfomance bug in v10 |