Using Threads to Overcome Synchronization Delays in Parallel Multiple Progressive Alignment Algorithms


Autoria(s): Marucci, Evandro A.[UNESP]; Zafalon, Geraldo F.D.; Momente, Julio C.; Pinto, Alex R.; Amazonas, Jose R.A.; Shiyou, Yang; Sato, Liria M.; Machado, Jose M.
Contribuinte(s)

Universidade Estadual Paulista (UNESP)

Data(s)

27/04/2015

27/04/2015

2012

Resumo

Sao Paulo State Research Foundation-FAPESP

Processo FAPESP: 06/59592-0

Problem statement: The parallelization of multiple progressive alignment algorithms is a difficult task. All known methods have strong bottlenecks resulting from synchronization delays. This is even more constraining in distributed memory systems, where message passing also delays the interprocess communication. Despite these drawbacks, parallel computing is becoming increasingly necessary to perform multiple sequence alignment. Approach: In this study, it is introduced a solution for parallelizing multiple progressive alignments in distributed memory systems that overcomes such delays. Results: The proposed approach uses threads to separate actual alignment from synchronization and communication. It also uses a different approach to schedule independent tasks. Conclusion/Recommendations: The approach was intensively tested, producing a performance remarkably better than a largely used algorithm. It is suggested that it can be applied to improve the performance of some multiple alignment tools, as CLUSTALW and MUSCLE.

Formato

50-63

Identificador

http://thescipub.com/abstract/10.3844/ajbsp.2012.50.63

American Journal of Bioinformatics, v. 1, n. 1, p. 50-63, 2012.

1948-9862

http://hdl.handle.net/11449/122821

http://dx.doi.org/10.3844/ajbsp.2012.50.63

0555619693238543

Idioma(s)

por

Relação

American Journal of Bioinformatics

Direitos

closedAccess

Palavras-Chave #Sequence alignment algorithms #Hidden Markov Models (HMM) #performance remarkably #progressive approach #computational complexity #represent genetic
Tipo

info:eu-repo/semantics/article