[font=“Arial”]Hi all,
I am looking for an efficient way to sum up all the elements in an array, which is basically a reduction function. I am kind of thinking to split the array into two arrays with equal lengths and then sum them up in parallel and call this function recursively. However, what is a good way to split the array in device into two? Or, is there any alternative way to do the sum up?
Thanks,
L [/font]