Empirical study on parallel computation ofCyclomatic complexity by the use ofMessage Passing Interface

Cyclomatic complexity is a software metric used to express the complexity of a software program It measures the number of linearly independent paths through a program s source code. Cyclomatic complexity is estimated using the control flow graph of the program. Cyclomatic complexity is authorized to be used to distinct functions, modules, methods or classes within program. One of the applications of Cyclomatic complexity is in specifying the number of test cases that are needed to achieve perfect test coverage of a specific module. In real world, control flow graph of programs huge and then computing the Cyclomatic complexity of these programs is time consuming According to application of parallel programming in speeding up the programs execution time, in this paper, with the help of message passing concept and MPI (Message Passing Interface), execution time for computing Cyclomatic complexity is reduced

کلیدواژه ها:

Cyclomatic complexity ، Search Based Software Engineering (SBSE) test coverage ، parallel programming ، MPI