异构网络环境下的并行程序可达性测试算法  

Reachability testing algorithm for parallel program in heterogeneous network environment

作　　者：王巍[1] 杜翠兰[2] 张宏莉[1] 

机构地区：[1]哈尔滨工业大学计算机网络与信息安全技术研究中心,黑龙江哈尔滨150001 [2]国家计算机网络应急技术处理协调中心,北京100029

出　　处：《通信学报》2006年第2期178-183,共6页Journal on Communications

基　　金：国家自然科学基金资助项目(90412001)~~

摘　　要：针对不确定性并行程序难于测试的问题,分析了并行程序消息传递行为与网格环境中网络性能约束之间的关系,在经典可达性测试算法的基础上,提出了新的限定性可达性测试算法,称为基于网络性能约束的可达性测试算法。本算法在考虑网络性能约束的基础上,只对发生频率高的执行路径进行测试,缩减了待测试路径的数量,提高测试效率,在此基础上尽可能保证测试的完全性。Orienting to difficulty of testing nondeterministic parallel programs, the relationship between message-passing behavior and network performance constraint in grid environment was analyzed, and a new limited teachability testing algorithm was proposed, which was called teachability testing algorithm with network performance constraint, based on classic teachability algorithm. This algorithm only tested those execution paths with high happening possibility, which can reduce the number of those paths to be tested. The testing efficiency is improved, and the testing completeness is held reasonably.

关 键 词：并行程序测试 网格计算 可达性 竞争情形 竞争派生 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]