From: | Thom Brown <thom(at)linux(dot)com> |
---|---|
To: | Greg Stark <stark(at)mit(dot)edu> |
Cc: | Greg Smith <greg(at)2ndquadrant(dot)com>, pgsql-hackers(at)postgresql(dot)org |
Subject: | Re: CUDA Sorting |
Date: | 2011-09-19 15:10:51 |
Message-ID: | CAA-aLv4Su7uem4Ogs0cFRLX9TEKgq8ZZm+OtMLMjw+9bxPrt_Q@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On 19 September 2011 15:54, Greg Stark <stark(at)mit(dot)edu> wrote:
> On Mon, Sep 19, 2011 at 3:36 PM, Greg Smith <greg(at)2ndquadrant(dot)com> wrote:
>> The main problem here is that the sort of hardware commonly used for
>> production database servers doesn't have any serious enough GPU to support
>> CUDA/OpenCL available
>
> Of course that could change if adding a GPU would help Postgres... I
> would expect it to help mostly for data warehouse batch query type
> systems, especially ones with very large i/o subsystems that can
> saturate the memory bus with sequential i/o. "Run your large batch
> queries twice as fast by adding a $400 part to your $40,000 server"
> might be a pretty compelling sales pitch :)
>
> That said, to help in the case I described you would have to implement
> the tapesort algorithm on the GPU as well. I expect someone has
> implemented heaps for CUDA/OpenCL already though.
I seem to recall a paper on such a thing by Carnegie Mellon
University. Can't remember where I saw it though.
--
Thom Brown
Twitter: @darkixion
IRC (freenode): dark_ixion
Registered Linux user: #516935
EnterpriseDB UK: http://www.enterprisedb.com
The Enterprise PostgreSQL Company
From | Date | Subject | |
---|---|---|---|
Next Message | Thom Brown | 2011-09-19 15:12:10 | Re: CUDA Sorting |
Previous Message | Greg Sabino Mullane | 2011-09-19 15:09:05 | Re: Generating a query that never returns |