In EDS ansehen

Parallel program testing based on critical communication and branch transformation.

Gespeichert in:
Bibliographische Detailangaben
Titel: Parallel program testing based on critical communication and branch transformation.
Autoren: Tian, Tian, Wang, Anshi, Yang, Xiuting, Gong, Dunwei, Hou, Tie, Yao, Xiangjuan
Quelle: Journal of Supercomputing; Jan2024, Vol. 80 Issue 1, p519-548, 30p
Schlagwörter: GENETIC algorithms, COMPUTER software testing, COMMUNICATION barriers, TEST methods, EVALUATION methodology
Abstract: Software testing is an efficient way to guarantee the reliability and accuracy of parallel programs. Communication plays a substantial role in parallel program testing. The huge scale of communication within parallel programs poses a great challenge to coverage testing. How to reasonably select the communication to be tested and effectively generate test data to meet the requirements of coverage is a pressing problem. In this paper, a critical communication testing method based on branch transformation is proposed, which can reasonably select part of program communication and generate test data. To be specific, firstly, this paper analyzes the features which easily lead to defects in communication, and then proposes the evaluation method of critical communication based on the above features. Next, we select the critical communication and convert the communication coverage to the coverage of the branch where the communication statement resides. Finally, a method based on genetic algorithm is used to solve the communication coverage problem in different scenarios. The proposed method is applied to the testing of several representative parallel programs. Experimental results show that compared with other methods, this proposed method can effectively reduce the quantity of communication, significantly improve the coverage rate of communication coverage testing and increase the efficiency of test data generation. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Supercomputing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Datenbank: Complementary Index
Beschreibung
Abstract:Software testing is an efficient way to guarantee the reliability and accuracy of parallel programs. Communication plays a substantial role in parallel program testing. The huge scale of communication within parallel programs poses a great challenge to coverage testing. How to reasonably select the communication to be tested and effectively generate test data to meet the requirements of coverage is a pressing problem. In this paper, a critical communication testing method based on branch transformation is proposed, which can reasonably select part of program communication and generate test data. To be specific, firstly, this paper analyzes the features which easily lead to defects in communication, and then proposes the evaluation method of critical communication based on the above features. Next, we select the critical communication and convert the communication coverage to the coverage of the branch where the communication statement resides. Finally, a method based on genetic algorithm is used to solve the communication coverage problem in different scenarios. The proposed method is applied to the testing of several representative parallel programs. Experimental results show that compared with other methods, this proposed method can effectively reduce the quantity of communication, significantly improve the coverage rate of communication coverage testing and increase the efficiency of test data generation. [ABSTRACT FROM AUTHOR]
ISSN:09208542
DOI:10.1007/s11227-023-05460-4