Reachability testing algorithm for parallel program in heterogeneous network environment
|更新时间:2024-10-14
|
Reachability testing algorithm for parallel program in heterogeneous network environment
Issue 2, Pages: 178-183(2006)
作者机构:
哈尔滨工业大学计算机网络与信息安全技术研究中心 2. 国家计算机网络应急技术处理协调中心
作者简介:
基金信息:
DOI:
CLC:TP311.11
Published:2006
稿件说明:
移动端阅览
WANG Wei1, DU Cui-lan2, ZHANG Hong-li1. Reachability testing algorithm for parallel program in heterogeneous network environment[J]. 2006, (2): 178-183.
DOI:
WANG Wei1, DU Cui-lan2, ZHANG Hong-li1. Reachability testing algorithm for parallel program in heterogeneous network environment[J]. 2006, (2): 178-183.DOI:
Reachability testing algorithm for parallel program in heterogeneous network environment
摘要
针对不确定性并行程序难于测试的问题
分析了并行程序消息传递行为与网格环境中网络性能约束之间的关系
在经典可达性测试算法的基础上
提出了新的限定性可达性测试算法
称为基于网络性能约束的可达性测试算法。本算法在考虑网络性能约束的基础上
只对发生频率高的执行路径进行测试
缩减了待测试路径的数量
提高测试效率
在此基础上尽可能保证测试的完全性。
Abstract
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 reachability testing algorithm was proposed
which was called reachability testing algorithm with network performance constraint
based on classic reachability 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