吉林大学研究所课程-并行计算课件-第4章—并行计算基本设计技术.pptVIP

实例—求前缀和 实例—求前缀和 算法实现 Begin (1) for j=1 to l=n/p do B(0,l(s-1)+j)- A(l(s-1)+j) end for (2) for h=1 to k do (2.1)if(k-h-q=0) then for j=2k-h-q(s-1)+1 to 2k-h-qs do B(h,j)-B(h-1,2j-1)*B(h-1,2j) end for end if (2.2) if (s=2k-h) then B(h,s)-B(h-1,2s-1)*B(h-1,2s) end if end for 实例—求前缀和 (3) for h=k to 0 do (3.1) if(k-h-q=0) then for j=2k-h-q(s-1)+1 to 2k-h-qs do (1) if(j=even) then C(h,j)-C(h+1,j/2) end if (2) if(j=1) then C(h,1)-B(h,1