Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I have the optimized code for parallel (exclusive) scan algorithm, that’s written in OpenCL.
I’ve read that inner (dot) product of a vector is based on parallel reduction but I was wondering is it somehow possible to use this already finished scan algorithm for the purpose?
dot product by defintion is a reduction algorithm. The reduction algorithm is not too hard to implement and even a moderately optimized version is much faster than a scan algorithm. It is best if you wrote a fast reduction algorithm that you can use.