A Parallel Wavefront Algorithm for Efficient Biological Sequence Comparison
In this paper we present a parallel wavefront algorithm for computing an alignment between two strings A and C, with |A| = m and |C| = n. On a distributed memory parallel computer of p processors each with O((m + n)/p) memory, the proposed algorithm requires O(p) communication rounds and O(mn/p) local computing time. The novelty of this algorithm is based on a compromise between the workload of each processor and the number of communication rounds required, expressed by a parameter called α. The proposed algorithm is expressed in terms of this parameter that can be tuned to obtain the best overall parallel time in a given implementation. We show very promising experimental results obtained on a 64-node Beowulf machine. A characteristic of the wavefront communication requirement is that each processor communicates with few other processors. This makes it very suitable as a potential application for grid computing.
KeywordsParallel Algorithm Quadratic Space Parallel Time Communication Round Coarse Granularity
Unable to display preview. Download preview PDF.
- C. E. R. Alves, E. N. Cceres, F. Dehne, and S. W. Song. Parallel dynamic programming for solving the string editing problem on a CGM/BSP. In Proceedings of the 14th Symposium on Parallel Algorithms and Architectures (ACM-SPAA), pages 275–281. ACM Press, 2002.Google Scholar
- C. E. R. Alves, E. N. Cceres, F. Dehne, and S. W. Song. A CGM/BSP parallel similarity algorithm. In Proceedings of the I Brazilian Workshop on Bioinformatics, pages 1–8, october 2002.Google Scholar
- F. Dehne, A. Fabri, and A. Rau-Chaplin. Scalable parallel geometric algorithms for coarse grained multicomputers. In Proc. ACM 9th Annual Computational Geometry, pages 298–307, 1993.Google Scholar
- F. Dehne (Editor). Coarse grained parallel algorithms. Special Issue of Algorithmica, 24(3/4): 173–176, 1999.Google Scholar
- Z. Galil and K. Park. Parallel dynamic programming. Technical Report CUCS-040-91, Columbia University-Computer Science Dept., 1991.Google Scholar
- Z. Galil and K. Park. Dynamic programming with convexity, concavity and sparsity. Theoretical Computer Science, pages 49–76, 1992.Google Scholar
- M. Gengler. An introduction to parallel dynamic programming. Lecture Notes in Computre Science, 1054:87–114, 1996.Google Scholar
- J. Setubal and J. Meidanis. Introduction to Computational Molecular Biology. PWS Publishing Company, 1997.Google Scholar