Skip to content
Free planNo credit card requiredStart writing

article · 2010

Multi-level parallelism in Phylocon algorithm

Hazrina Yusof Hamdani, Nur’Aini Abdul Rashid

Cited by 0Abstract and details only

Abstract

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.

Cite this paper

APA 7

Hamdani, H. Y., & Rashid, N. A. (2010). Multi-level parallelism in Phylocon algorithm. https://doi.org/10.1109/itsim.2010.5561606

MLA 9

Hamdani, Hazrina Yusof, and Nur’Aini Abdul Rashid. “Multi-level parallelism in Phylocon algorithm.” vol. 1, 2010, pp. 710–14, https://doi.org/10.1109/itsim.2010.5561606.

Chicago

Hamdani, Hazrina Yusof, and Nur’Aini Abdul Rashid. 2010. “Multi-level parallelism in Phylocon algorithm.” https://doi.org/10.1109/itsim.2010.5561606.

Harvard

Hamdani, H.Y. and Rashid, N.A. (2010) ‘Multi-level parallelism in Phylocon algorithm’. Available at: https://doi.org/10.1109/itsim.2010.5561606.

BibTeX
@article{hamdani2010multi,
  title = {{Multi-level parallelism in Phylocon algorithm}},
  author = {Hamdani, Hazrina Yusof and Rashid, Nur’Aini Abdul},
  volume = {1},
  pages = {710--714},
  year = {2010},
  doi = {10.1109/itsim.2010.5561606}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.