Parallelizing and optimizing a bioinformatics pairwise sequence alignment algorithm for many-core architecture

详细信息    查看全文

• 作者：David D&#xed ; az^a ; ^{david.diaz@lcc.uma.es"" rel=""nofollow} ; Francisco Jos&#xe9 ; Esteban^b ; ^{fjesteban@uco.es"" rel=""nofollow} ; Pilar Hern&#xe1 ; ndez^c ; ^{phernandez@ias.csic.es"" rel=""nofollow} ; Juan Antonio Caballero^d ; ^{ma1camoj@uco.es"" rel=""nofollow} ; Gabriel Dorado^e ; ¹ ; ^{bb1dopeg@uco.es"" rel=""nofollow} ; Sergio G&#xe1 ; lvez^a ; ¹ ; ^{galvez@lcc.uma.es"" rel=""nofollow} ; ^{galvez@uma.es"" rel=""nofollow}
• 关键词：Tile64 processor ; Multi-core parallelization ; System-on-chip ; Chip multiprocessor architecture ; Needleman– ; Wunsch ; Smith– ; Waterman ; High performance optimization ; Multithreading
• 刊名：Parallel Computing
• 出版年：2011
• 出版时间：April-May 2011
• 年：2011
• 卷：37
• 期：4-5
• 页码：244-259
• 全文大小：1057 K

文摘

Current computer engineering evolves at an accelerated pace, with hardware advancing towards new chip multiprocessors (CMP) architectures and with supporting software gearing towards new programming and abstraction paradigms, to obtain the maximum efficiency of the hardware at a low cost. In this context, Tilera Corporation has developed a brand new CMP architecture with 64 cores (tiles) called Tile64, and has launched several Peripheral Component Interconnect Express (PCIe) cards to be used and monitored from a host Personal Computer (PC). These cards may execute parallel applications built in C/C++ and compiled with the Tile-GCC compiler. We have previously demonstrated the usefulness of the Tile64 architecture for bioinformatics [S. Gálvez, D. Díaz, P. Hernández, F.J. Esteban, J.A. Caballero, G. Dorado, Next-generation bioinformatics: using many-core processor architecture to develop a web service for sequence alignment, Bioinformatics, 26 (2010) 683–686]. We have chosen a bioinformatics algorithm to test this many-core Tile64 architecture because of actual bioinformatics challenging needs: data-intensive workloads, space and time-consuming requirements and massive calculation. This algorithm, known as Needleman–Wunsch/Smith–Waterman (NW/SW), obtains an optimal sequence alignment in quadratic time and space cost, yet requires to be optimized to take full advantage of computing parallelization. In this paper we redesign, implement and fine-tune this algorithm, introducing key optimizations and changes that take advantage of specific Tile64 characteristics: RISC architecture, local tile’s cache, length of memory word, shared memory usage, RAM file system, tile’s intercommunication and job selection from a pool. The resulting algorithm – named MC64-NW/SW for Multicore64 Needleman–Wunsch/Smith–Waterman – achieves a gain of 1000 % when compared with the same algorithm on a ×86 multi-core architecture. As far as we know, our NW/SW implementation is the fastest ever published for a standalone PC when aligning a pair of sequences larger than 20 kb.