Multi-level parallelism in Phylocon algorithm

In this paper we investigate the advantages of multi-level parallelism on PhyloCon algorithm. The PhyloCon algorithm naturally possesses multi-levels of functions which cost the execution time took longer to complete. We showed that by applying parallelism to the selected level of functions may significantly reduce the execution time. The selected level of functions produced the independent outer-level parallelism and the independent inner-level parallelism. The details of each independent level of parallelism applied in PhyloCon algorithm are also were shown. The result of the research shows that multilevel parallelism produced a better performance compared to independent level parallelism which half of sequential execution time can be reduced using multi-level parallelism.