Skip to main navigation Skip to search Skip to main content

Reachability testing algorithm for parallel program in heterogeneous network environment

  • Wei Wang*
  • , Cui Lan Du
  • , Hong Li Zhang
  • *Corresponding author for this work
  • Harbin Institute of Technology
  • National Computer Network Emergency Response Technical Team Coordination Center of China

Research output: Contribution to journalArticlepeer-review

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 languageEnglish
Pages (from-to)178-183
Number of pages6
JournalTongxin Xuebao/Journal on Communications
Volume27
Issue number2
StatePublished - 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