| 摘要: |
| 本文给出了计算图的所有顶点间的距离矩阵Ｄ及最短路径矩阵Ｐ的一串行和异步并行算法．利用上述结果，又得到其他图论问题的高效异步并行算法，并介绍了用ＡＤＡ语言对异步并行算法实现的主要步骤． |
| 关键词: 并行图算法，异步算法 |
| DOI： |
| 分类号: |
| 基金项目:本文研究得到山东省自然科学基金资助项目. |
|
| EFFICIENT ASYNCHRONIZED GRAPH ALGORITHMS AND ADA CODING |
|
Ma Jun,Ma Shaohan
|
| Abstract: |
| 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. |
| Key words: Parallel graph algorithms, asynchronised algorithms. |
