Comparative Analysis of Execution Time for Sequential and Data-Decomposed Parallel Program

When complex computing in programming is mandatory, it’s important to choose a proper way to minimize execution time. Sequential and parallel approaches to source code execution each have their own pros and cons, and programmers must make valid decisions based on these factors. In this paper, we will conduct the comparative analysis of the performances of both approaching ways, and consider their application in different business and mathematics areas. Based on the experimental results, it was concluded that as the volume of the data processed by the program increases, parallel execution becomes more favorable, whereas sequential execution is more efficient for smaller data sizes. Additionally, the point at which sequential execution ceases to be more efficient was identified.