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 am writing a function in c++ that computes the sum of double numbers in parallel using MPI.
I assume that each process has its number and the problem is to find the sum of all numbers in each processor in parallel using binary tree method where each node is a process. So the algorithm must work in O(logn).
Does anybody has any ideas about this problem or already ready code in MPI?
Yes, use the MPI_Reduce function where the op argument is MPI_SUM. AFAIK the standard doesn’t specify how the reduction is done, but I’m quite sure any competitive MPI library will use a tree reduction algorithm.