Rights accessRestricted access - publisher's policy
Biological sequence comparison is one of the most important tasks in Bioinformatics. Due to the growth of biological databases,
sequence comparison is becoming an important challenge for high performance computing, especially when very long sequences are compared.
The Smith-Waterman (SW) algorithm is an exact method based on dynamic programming to quantify local similarity between sequences. The inherent large parallelism of the algorithm makes it ideal for architectures
supporting multiple dimensions of parallelism (TLP, DLP and ILP). In this work, we show how long sequences comparison takes advantage of current and future multicore architectures. We analyze two different SW implementations on the CellBE and use simulation tools to study the
performance scalability in a multicore architecture. We study the memory
organization that delivers the maximum bandwidth with the minimum cost. Our results show that a heterogeneous architecture is an valid alternative to execute challenging bioinformatic workloads.
CitationSanchez, F. [et al.]. Long DNA sequence comparison on multicore architectures. A: EURO-PAR Conference. "EURO-PAR Conference 2010". Ischia: Springer Verlag, 2010, p. 247-259.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com