Reputation: 1492
I have a sorted set of arrays of unsigned shorts e.g:
12, 222, 333, 444, 555
78, 456, 123, 987, 231
I wish to find either the first or all of those arrays that match a set of given predicates: e.g: [idx[1] = 222, idx[3] = 444], would match the first row as the value at index 1 is 222 and the value at index 3 is 444.
Is this a task where I would see an advantage from running the search on the GPU via OpenCL? The volume of data is 1 to 2 hundred million items.
Upvotes: 0
Views: 156
Reputation: 62469
Sure, if you have sufficient rows to make it worth the parallelization, you could test each row in separate kernel (since they are independent) and get a good speedup if you have e decent GPU.
Upvotes: 1