| 一个有效的图匹配并行分布式算法 |
| |
| 引用本文： | 向珏良.一个有效的图匹配并行分布式算法[J].上海工程技术大学学报,1995,9(4):54-58. |
| |
| 作者姓名： | 向珏良 |
| |
| 作者单位： | 上海工程技术大学计算中心!上海200335 |
| |
| 摘 要： | 本文介绍了柔性制造系统（ＦＭＳ）中资源分配问题的一种有效的并行分布式算法，将资源分配转换成一个图匹配问题后，对多项式复杂性Ｂｌｏｓｓｏｍ算法，改制并设计成并行算法。该算法采用了分割，子图的ＣＭＰ，边界桥对接，渗透生长及合并方法，在并行机Ｔｒａｎｓｐｕｔｅｒ上用并行方法实现了图的最大匹配。
|
| 关 键 词： | 资源分配 并行分布式算法 柔性制造系统 图 |
AN EFFECTIVE PARALLEL DISTRIBUTED ALGORITHM FOR GRAPH MATCHING |
| |
| Xiang Jueliang.AN EFFECTIVE PARALLEL DISTRIBUTED ALGORITHM FOR GRAPH MATCHING[J].Journal of Shanghai University of Engineering Science,1995,9(4):54-58. |
| |
| Authors: | Xiang Jueliang |
| |
| Affiliation: | Xiang Jueliang |
| |
| Abstract: | This paper introduced an effective parallel distributed algorithm for resource allocation problem in a flexible manufacturing system(FMS). A parallelization of Blossom algorithm, a polynomial-complexity algorithm, is developed after transforming resource allocation to a graph matching problem. It adopted partition, CMP in subgraph, boundary bridge check, roving and combination to realize the maximum graph matchig in parallel method in transputer. |
| |
| Keywords: | Resoutce allocation Parallel distributed algorithm Parallel computers Flexible manufacturing system |
| 本文献已被 CNKI 维普 等数据库收录！ |
