Gpu methods to locate unique IDs

12 次查看（过去 30 天）
EssGee
EssGee 2013-4-9
Hi,
I am just looking for some ideas to solve this problem on gpu with matlab.
There is a 2 x N vector. Row 1 has N has Ids which can be duplicate. Row 2 has corresponding numerical values. I need to sum all the values for which there is a unique column ID.
Input : [1 1 1 2 2 3 3; 10 11 12 13 14 15 16] Output : [1 2 3; 33 27 31]
A vectorized solution of this on a GPU I am guessing would be the fastest
Any suggestions would be greatly appreciated.
Thanks

请先登录，再回答此问题。

回答（1 个）

Jan
Jan 2013-4-9
Start with an implementation on the CPU using accumarray.
Then decide, if the index vector is dense, this means if it contains values from 1 to N, which are all positive integers without larger gaps. Then it is much faster to accumulate the values using them as indixes. In this case a C-Mex function might be very efficient.
  3 个评论
显示 1更早的评论
Jan
Jan 2013-4-12
Please explain, if the IDs are "dense" positive integers. I'm not convinced, that this is most efficient on the GPU. How large is the array?
EssGee
EssGee 2013-4-12
Yes the IDs are positive integers, with no gaps. I am also not very sure that this a GPU problem. However most of the calculations leading up to this operations were on the GPU. so transferring the data out of the GPU just for this would be a big overhead.

请先登录，再进行评论。

类别

在 Help Center 和 File Exchange 中查找有关 GPU Computing 的更多信息

标签

产品

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by