Parallel Strategies for Local Biological Sequence Alignment in a Cluster of Workstations

Authors:
Azzedine Boukerche;Alba Cristina Magalhaes Alves de Melo;Mauricio Ayala-Rincon;Thomas Mailleux Santana
Affiliations:
University of Ottawa, Canada;University of Brasilia, Brazil;University of Brasilia, Brazil;University of Brasilia, Brazil
Venue:
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 15 - Volume 16
Year:
2005

Citing 5
Cited 3

Memory consistency models

ACM SIGOPS Operating Systems Review
In search of clusters: the coming battle in lowly parallel computing

In search of clusters: the coming battle in lowly parallel computing
Algorithms for the Longest Common Subsequence Problem

Journal of the ACM (JACM)
JIAJIA: A Software DSM System Based on a New Cache Coherence Protocol

HPCN Europe '99 Proceedings of the 7th International Conference on High-Performance Computing and Networking
Using a DSM application to locally align DNA sequences

CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid

Quantitative analysis of sequence alignment applications on multiprocessor architectures

Proceedings of the 6th ACM conference on Computing frontiers
Long DNA sequence comparison on multicore architectures

Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
Parallel performance evaluation of multithreaded local sequence alignment

Proceedings of the 12th International Conference on Computer Systems and Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sequence comparison is a basic operation in DNA sequencing projects, and most of sequence comparison methods used are based on heuristics, which are faster but there are no guarantees that the best alignments will be produced. On the other hand, the algorithm proposed by Smith-Waterman obtains the best local alignments at the expense of very high computing power and huge memory requirements. In this article, we present and evaluate our experiments with three strategies to run the Smith-Waterman algorithm in a cluster of workstations using a Distributed Shared Memory System. Our results on an eight-machine cluster presented very good speedups and indicate that impressive improvements can be achieved, depending on the strategy used. Also, we present some theoretical remarks on how to reduce the amount of memory used.