Reducing scheduling sequences of message-passing parallel programs |
| |
| Affiliation: | 1. School of Information and Electrical Engineering, China University of Mining and Technology, Xuzhou, Jiangsu, 221116, P.R. China;2. School of Electrical Engineering and Information Engineering, LanZhou University of Technology, Lanzhou, Gansu 730000, P.R. China;3. School of Computer Science and Technology, Shandong Jianzhu University, Jinan, Shandong 250101, P.R. China;4. College of Information Science and Technology, Beijing University of Chemical Technology, Beijing 100029, P.R. China;1. Departamento de Engenharia de Produção, Centro de Tecnologia, Universidade Federal da Paraíba, Campus I - Bloco G, Cidade Universitíria, 58051-970, João Pessoa, PB , Brazil;2. Departamento de Sistemas de Computação, Centro de Informática, Universidade Federal da Paraíba, Rua dos Escoteiros, Mangabeira, 58058-600, João Pessoa, PB, Brazil;3. School of Management, University of Bath, Bath BA2 7AY, United Kingdom;4. CIRRELT and HEC Montréal, Montréal H3T 2A7, Canada;1. Universidad de Málaga, Atenea Research Group, Bulevar Louis Pasteur, 35. (29071) Málaga, Spain;2. Vienna University of Technology, Business Informatics Group, Karlsplatz 13. (1040) Vienna, Austria;1. Chalmers and the University of Gothenburg, Sweden;2. Federal University of Campina Grande, PB, Brazil;3. Huawei Technologies Sweden AB, Sweden;1. Department of Computer Science, University of Helsinki, P.O. 68 (Gustaf Hällströmin katu 2b), FI-00014 University of Helsinki, Finland;2. Department of Pervasive Computing, Tampere University of Technology, Korkeakoulunkatu 1, FI-33720 Tampere, Finland;3. Department of Computer Science and Engineering, Aalto University School of Science, P.O. Box 19210, FI-00076 Aalto, Finland |
| |
| Abstract: | Context: Message-passing parallel programs are commonly used parallel programs. Various scheduling sequences contained in these programs, however, increase the difficulty of testing them. Therefore, reducing scheduling sequences by using appropriate approaches can greatly improve the efficiency of testing these programs.Objective: This paper focuses on the problem of reducing scheduling sequences of message-passing parallel programs, and presents a novel approach to reducing scheduling sequences.Method: In this approach, scheduling sequences that affect the target statement are first determined based on the relation between a scheduling sequence and the execution of the target statement. Then, these scheduling sequences are divided into a number of equivalent classes according to the execution of the target statement. Finally, for each scheduling sequence in the same equivalent class, the values of the two proposed indexes are calculated, and the scheduling sequence with the minimal comprehensive value is selected as the one after reduction.Results: To evaluate the performance of the proposed approach, it is applied to test 12 typical message-passing parallel programs. The experimental results show that the proposed approach reduces 63% scheduling sequences on average. And compared with the method without reduction, and the method with randomly selecting scheduling sequences, the proposed approach shortens 67% and 52% execution time of a program for covering the target statement on average, respectively.Conclusion: The proposed approach can greatly reduce scheduling sequences, and shorten execution time of a program for covering the target statement, hence improving the efficiency of testing the program. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
