%0 Journal Article
%T Practical parallel algorithm for all-pairs shortest-path problem<br>一种实用的所有点对之间最短路径并行算法
%A ZHOU Yi-ming
%A SUN Shi-xin
%A TIAN Ling
%A <br>周益民
%A 孙世新
%A 田玲
%J 计算机应用
%D 2005
%I 
%X Aiming at the all-pairs shortest-path problem in the directed graph, a practical parallel algorithm, which based on the Floyd algorithm with an extended path array, was brought forward on 2-13 mesh network . The planar evenly partition method was chosen for task division in this parallel algorithm. The parallel algorithm was implemented on MPI on NOW. The theoretical analysis and the experimental results prove that the parallel algorithm is an efficient and scalable algorithm.
%K all-pairs shortest-path problem
%K Floyd algorithm
%K parallel algorithm<br>所有点对之间最短路径
%K Floyd算法
%K 并行算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=8641A041FF1AF5C5&yid=2DD7160C83D0ACED&vid=C5154311167311FE&iid=59906B3B2830C2C5&sid=99994357D95ED272&eid=934616154FBBE78A&journal_id=1001-9081&journal_name=计算机应用&referenced_num=6&reference_num=5