| 基于树的AOV网并行性全拓扑排序算法设计与实现 |
| |
| 引用本文： | 李俐玲,姜玉苹. 基于树的AOV网并行性全拓扑排序算法设计与实现[J]. 绵阳师范学院学报, 2007, 26(5): 116-121 |
| |
| 作者姓名： | 李俐玲 姜玉苹 |
| |
| 作者单位： | 绵阳师范学院数学与信息科学系,四川绵阳,621000 |
| |
| 摘 要： | 讨论了AOV网的一种并行性全拓扑排序的算法及实现,解决了传统拓扑排序算法的单一性问题,说明了并行全拓扑排序有重要的实用价值。
|
| 关 键 词： | AOV网 并行性全拓扑排序 拓扑树 |
| 文章编号： | 1672-612x（2007）05-0116-06 |
| 修稿时间： | 2007-02-09 |
The Design and Realization of Overall-Topological Sorting Algorithm for the Parallel Tree-based AOV-net |
| |
| LI Li-ling,JIANG Yu-Ping. The Design and Realization of Overall-Topological Sorting Algorithm for the Parallel Tree-based AOV-net[J]. Journal of Mianyang Normal University, 2007, 26(5): 116-121 |
| |
| Authors: | LI Li-ling JIANG Yu-Ping |
| |
| Affiliation: | Department of Mathematics and Information Science, Mianyang Normal University, Mianyang, Sichuan 621000 |
| |
| Abstract: | The design and the implementation of a parallel and overall-topological sorting algorithm have been discussed;the singularity of the traditional topological sorting algorithm has been avoided,which shows that the parallel and overall-topological sort is of great importance and value in practice. |
| |
| Keywords: | AOV-net parallel and overall-topological sort topological tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
