From: | Dimitri Fontaine <dfontaine(at)hi-media(dot)com> |
---|---|
To: | pgsql-hackers(at)postgresql(dot)org |
Cc: | Ron Mayer <rm_pg(at)cheapcomplexdevices(dot)com>, Simon Riggs <simon(at)2ndquadrant(dot)com> |
Subject: | Re: Sorting Improvements for 8.4 |
Date: | 2007-12-18 09:03:25 |
Message-ID: | 200712181003.27337.dfontaine@hi-media.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
Hi,
Le mardi 18 décembre 2007, Ron Mayer a écrit :
> Has anyone looked into sorting algorithms that could use
> more than one CPU or core at a time?
[...]
> PS: Yeah, I know multi-threading is a hot-button on these
> lists; but sorting seems a relatively isolated of the code
> and I'd wonder if it'd be isolate-able enough that multiple
> CPUs could be used there.
And before that objection to multi-threading implementation and portability
concerns arise, what about using a coroutine BSD-licenced portable
implementation such as Protothreads to have backend code use several CPU at a
time?
http://www.sics.se/~adam/pt/
With such a tool, would it be possible to think about producer/consumer
parallel executions for sorting, aggregates nodes or other parts of the
executor?
Hope this helps, regards,
--
dim
From | Date | Subject | |
---|---|---|---|
Next Message | Oleg Bartunov | 2007-12-18 09:09:28 | Re: Board for developers |
Previous Message | Trevor Talbot | 2007-12-18 06:29:54 | Re: EXPLAIN ANALYZE printing logical and hardware I/O per-node |