uuuhhh that's unfortunate.
I don't have expertise in that, I was trying to research on the web and
eventually found :
that sounded promsing to me, but as I said I don't have expertise in this
to properly judge.
thank you anyway to you and the community.
however, if someone is researching on this topic (intersection of lists of
keywords), could please let the community informed ?
thank you so much!
On Sun, Dec 21, 2014 at 11:07 PM, Andreas Kloeckner <lists(a)informa.tiker.net
Luigi Assom <luigi.assom(a)gmail.com> writes:
thank you for your feedback:
Which prerequisite must have a data structure to be good for GPU?
Should I allocate exact size of memory for each array ?
I hate to say it, but let me just state two facts: (1) There's no canned
functionality for what you'd like to accomplish (intersection of string
lists, IIUC). You'd have to piece this together out of parallel
primitives (scan/sort) or just handwritten (in C) kernels. String
sorting on the GPU is something that people publish legitimate research
papers on. (2) Learning to do these things (unfortunately) takes a
considerable time investment--think months. So please understand that
the friendly folks on the mailing list won't be able to give you a quick
tutorial, or even provide you with an 'easy answer'.
Skype contact: oggigigi