Affiliation:
1. Benemérita Universidad Autónoma de Puebla, Puebla, Mexico
Abstract
Within an environment of parallel objects, an approach of structured parallel programming and the paradigm of the orientation to objects show a programming method based on high level parallel compositions or HLPCs to solve two problems of combinatorial optimization: grouping fragments of DNA sequences and the parallel exhaustive search (PES) of RNA strings that help the sequence and the assembly of DNAs. The pipeline and farm models are shown as HLPCs under the object orientation paradigm and with them it is proposed the creation of a new HLPCs that combines and uses the previous ones to solve the cited problems. Each HLPC proposal contains a set of predefined synchronization constraints between processes, as well as the use of synchronous, asynchronous and asynchronous future modes of communication. This article shows the algorithms that solve the problems, their design and implementation as HLPCs and the performance metrics in their parallel execution using multicores and video accelerator card.
Reference40 articles.
1. Alba, E., Luque, G., & Khuri, S. (2205). Assembling DNA fragments with parallel algorithms. In The 2005 IEEE Congress on Evolutionary Computation. .
2. SklE: A Heterogeneous Environment for HPC Applications.;D.Bacci;Parallel Computing,1999
3. Baker, M. 2012. De novo genome assembly: what every biologist should know. Nature America Inc, 9(4), 333-337. Retrieved from http://www.nature.com/nmeth/journal/v9/n4/full/nmeth.1935.html