Abstract: The increase of communication scale and non-deterministic communication make the communication test of Message-Passing Interface (MPI) parallel programs more difficult. In order to solve the problems, a new method of reducing communication coverage based on dominant relation was proposed. Firstly, based on the correspondence between communications and communication statements, the reduction problem of communications was converted into a reduction problem of communication statements. Then, the dominant relation of statements was used to solve the reduction set of communication statement set. Finally, the communications related to the reduction set were selected as the targets to be covered, so that the test data covering these targets covered all the communications. The proposed method was applied to 7 typical programs under test. Experimental results show that, compared with the test data generation method with all communication as coverage targets, the proposed method can reduce the generation time of test data by up to 95% without reducing the coverage rate of communications, indicating that the proposed method can improve the generation efficiency of communication coverage test data.

Key words: parallel program, communication coverage, communication reduction, dominant relation, test data

摘要： 针对通信规模的增大及不确定通信使得消息传递接口（MPI）并行程序通信测试难度增大的问题，提出了基于占优关系的通信覆盖约减方法。首先，基于通信与通信语句间的对应关系，将通信约减问题转换为通信语句的约减问题；然后，利用语句占优关系求解通信语句集的约减集；最后，选择与约减集相关的通信作为覆盖目标，使得覆盖这些目标的测试数据能够覆盖全部通信。将所提方法应用到7个典型被测程序中。实验结果表明，在不降低通信覆盖率的前提下，相较于以全部通信作为覆盖目标的测试数据生成方法，所提方法减少的测试数据的生成时间最高达95%，提高了通信覆盖测试数据生成的效率。

关键词: 并行程序, 通信覆盖, 通信约减, 占优关系, 测试数据