%0 Journal Article
%T EFFICIENT ASYNCHRONIZED GRAPH ALGORITHMS AND ADA CODING<br>高效异步并行图算法及ADA的实现
%A Ma Jun
%A Ma Shaohan
%A <br>马军
%A 马绍汉
%J 软件学报
%D 1995
%I 
%X In this paper, both a sequential and an asynchronised algorithm to compute the all pair shortest distance matrix D and the path matrix P are given. This result is applied to develop other asynchronized graph algorithms. The main steps to code these asynchronised algorithms in ADA are introduced.
%K Parallel graph algorithms
%K asynchronised algorithms<br>并行图算法，异步算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=742FA38B5F5412CE0BECCD95FF540212&yid=BBCD5003575B2B5F&vid=B31275AF3241DB2D&iid=CA4FD0336C81A37A&sid=2001E0D53B7B80EC&eid=94E7F66E6C42FA23&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=8