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, and the testing completeness is held reasonably.
| Original language | English |
|---|---|
| Pages (from-to) | 178-183 |
| Number of pages | 6 |
| Journal | Tongxin Xuebao/Journal on Communications |
| Volume | 27 |
| Issue number | 2 |
| State | Published - Feb 2006 |
Keywords
- Grid computing
- Parallel program testing
- Race condition
- Race_variants
- Reachability
Fingerprint
Dive into the research topics of 'Reachability testing algorithm for parallel program in heterogeneous network environment'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver