By Topic

Testing of parallel programs based on primitive dependence graph

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
H. -P. Wu ; Dept. of Comput. Sci., Changsha Inst. of Technol., Changsha, Hunan, China

Because of the nondeterministic timing ordering behavior of parallel primitives, testing of parallel programs is more difficult than that of serial programs. In this paper, we present a new testing strategy for parallel programs---static testing of parallel programs with their primitive dependence graphs. We have developed methods to analyze the timing ordering dependences between primitives and to construct primitive dependence graph. Approaches for static detecting errors with primitive dependence graph have also been discussed

Published in:

Test Symposium, 1993., Proceedings of the Second Asian

Date of Conference:

16-18 Nov 1993