【作者】 王巍； 方滨兴； 张宏莉；

【Author】 Wang Wei, Fang Binxing, Zhang Hongli (Computer network and Information Security Research Center, Harbin Institute of Technology, Harbin 150001)

【机构】 哈尔滨工业大学计算机网络与信息安全技术研究中心；

【摘要】 并行程序执行行为的不确定性使得测试并行程序十分困难。可达性测试是一种系统的测试方法, 可以对不确定性并行程序进行完全测试。但是传统可达性测试会生成大量的测试路径,在实际应用中会产生的开销过大, 难以用于实际应用中。在并行程序测试过程中考虑一些外部条件约束会提高可达性测试的效率。本文通过分析并行程序消息传递行为与网格环境中网络性能约束之间的关系,提出了新的限定性可达性测试算法,称为基于网络性能约束的可达性测试算法。本算法在考虑网络性能约束的基础上,只对发生频率高的执行路径进行测试,缩减了待测试路径的数量,提高测试效率,在此基础上尽可能保证测试的完全性。更多还原

【Abstract】 The nondeterminism of parallel program running makes it difficult for testing. Reachability testing is a systematic testing, which can test parallel program more completely. When practical applications are considered, the plain reachability testing method will generate large number of execution paths to be tested, which may not be dealt with in reasonable time. Some additional conditions can be considered when the testing is carried out. In this paper, the relationship between the behavior of parallel program and network performance constraints in grid environment is taken into consideration. A new limited reachability algorithm is presented, by which many testing paths are pruned, the testing efficiency is improved, and the testing completeness is held reasonably.更多还原