并行算法 1:icol =0 2: for j=0 to n-2 do 3: if myid=j mod p then 4: find l laLicoll maxflai,icoll,i=j,j+1,...,n-1} if al.icol=0 then kill all processes A is singular and return 6 if Ij then swap aj,icol and aiicol 作 aiicol diicol/ajricol,i=j+1,...,n-1 fi-j-1=ai,icol;i=j+1,...:n-1 9 send(l,myid+1 mod p)and send(f,myid+1 mod p) 10: icol icol+1 11: else 12 recv(l,myid-1modp)and recv(f,myid-1modp)%广播1和f 13: if myid+1 mod pthen send(l,myid+1 mod p)and send(f,myid +1 mod p) 14 end if 15: if l j then swap Aj.:and AL.: 16: for k icol to m-1 do 17: aik aik fi-j-lajk,i=j+1,...n-1 18: end for 19:end for http://math.ecnu.edu.cn/~jypanhttp://math.ecnu.edu.cn/~jypan 并行算法