| From: | Andres Freund <andres(at)anarazel(dot)de> |
|---|---|
| To: | Thomas Munro <thomas(dot)munro(at)gmail(dot)com> |
| Cc: | Daniel Gustafsson <daniel(at)yesql(dot)se>, pgsql-hackers <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | Re: A qsort template |
| Date: | 2021-03-11 18:58:47 |
| Message-ID: | 20210311185847.zwb2rf3n4wzelkba@alap3.anarazel.de |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
Hi,
I wish we had the same for bsearch... :)
On 2021-03-03 17:17:13 +1300, Thomas Munro wrote:
> As for which cases are actually worth specialising, I've attached the
> example that Andres mentioned earlier; it seems like a reasonable
> candidate to go ahead and commit too, but I realised that I'd
> forgotten to attach it earlier.
> From 4cec5cb9a2e0c50726b7337fb8221281e155c4cd Mon Sep 17 00:00:00 2001
> From: Thomas Munro <thomas(dot)munro(at)gmail(dot)com>
> Date: Thu, 18 Feb 2021 14:47:28 +1300
> Subject: [PATCH] Specialize checkpointer sort functions.
>
> When sorting a potentially large number of dirty buffers, the
> checkpointer can benefit from a faster sort routine. One reported
> improvement on a large buffer pool system was 1.4s -> 0.6s.
>
> Discussion: https://postgr.es/m/CA%2BhUKGJ2-eaDqAum5bxhpMNhvuJmRDZxB_Tow0n-gse%2BHG0Yig%40mail.gmail.com
Looks good to me.
Greetings,
Andres Freund
| From | Date | Subject | |
|---|---|---|---|
| Next Message | David Bowen | 2021-03-11 19:06:06 | Re: pgbench - add pseudo-random permutation function |
| Previous Message | Tom Lane | 2021-03-11 18:49:02 | Re: [HACKERS] PATCH: Batch/pipelining support for libpq |