Abstract
Finding the Longest Common Subsequence (LCS) is a traditional and well studied problem in bioinformatics and text editing. In this paper, a customized parallel algorithm based on the Partitioned Global Address Space (PGAS) programming model to compute the LCS is presented. The algorithm is based on two related parameters balancing the communication and the synchronization needs in order to find the best data and workload distributions. The basic design of the algorithm and its complexity analysis are discussed together with experimental results. These results show the impact of those parameters on PGAS algorithm performance.
Chapter PDF
Similar content being viewed by others
Keywords
References
Yap, T.K., Frieder, O., Martino, R.L.: Parallel Computation in Biological Sequence Analysis. IEEE Transactions on Parallel and Distributed Systems 9(3), 283–294 (1998)
YarKhan, A., Dongarra, J.: Biological Sequence Alignment on the Computational Grid Using the GrADS Framework. Future Generation Computer Systems 21(6), 980–986 (2005)
Bergroth, L., Hakonen, H., Raita, T.: A Survey of Longest Common Subsequence Algorithms. In: Proc. 7th Internat. Symp. On String Processing Information Retrieval (SPIRE 2000), pp. 39–48 (2000)
Chen, Y., Wan, A., Liu, W.: A fast Parallel Algorithm for Finding the Longest Common Sequence of Multiple Bio-sequences. In: Symposium of Computations in Bioinformatics and Bioscience in conjunction with the International Multi-Symposiums on Computer and Computational Sciences (2006)
Alves, C.E.R., Cáceres, E.N., Dehne, F., Song, S.W.: A Parallel Wavefront Algorithm for Efficient Biological Sequence Comparison. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds.) ICCSA 2003. LNCS, vol. 2668, pp. 249–258. Springer, Heidelberg (2003)
Apostolico, A., Attalah, M., Lamore, L., Mcfaddin, S.: Efficient Parallel Algorithms for String Editing and Related Problems. SIAM Journal on Computing 19, 968–988 (1990)
Lu, M., Lin, H.: Parallel algorithms for the Longest Common Subsequence Problem. IEEE Transaction on Parallel and Distributed System 5, 835–848 (1994)
Alves, C.E.R., Cáceres, E.N., Dehne, F.: Parallel Dynamic Programming for Solving the String Editing Problem on a CGM/BSP. In: Proceeding of ACM SPAA, pp. 275–281 (2002)
Garcia, T., Myoupo, J.-F., Seme, D.: A Coarse-Grained Multi-computer Algorithm for the Longest Common Subsequence Problem. In: The Euromicro Conference on Parallel Distributed and Network based Processing (PDP 2003) (2003)
Valiant, L.G.: A Bridging Model for Parallel Computation. Communication of the ACM 33(8), 103–111 (1990)
El-Ghazawi, T., Carlson, W., Sterling, T., Yelick, K.: UPC: Distributed Shared Memory Programming. John Wiley & Sons Inc., New York (2005)
Gaber, J.: A Complexity Measure Approach for Partitioned Shared Memory Model, Application to UPC, Research report RR-10-04, Universite de Technologie de Belfort-Montbeliard (2004)
Bakhouya, M., Gaber, J., El-Ghazawi, T.: Towards a Complexity Model for Design and Analysis of PGAS-Based Algorithms. In: Perrott, R., Chapman, B.M., Subhlok, J., de Mello, R.F., Yang, L.T. (eds.) HPCC 2007. LNCS, vol. 4782, pp. 672–682. Springer, Heidelberg (2007)
Cantonnet, F., El Ghazawi, T., Lorenz, P., Gaber, J.: Fast Address Translation Techniques for Distributed Shared Memory Compilers. In: IPDPS (2006)
Pappas, N.P.: Searching Biological Sequence Databases Using Distributed Adaptive Computing. Master of Science in Computer Engineering, Virginia Polytechnic Institute and State University (2003), http://scholar.lib.vt.edu/theses/
Wagner, A., Fischer, M.J.: The String-to-String Correction Problem. Journal of the ACM 21(1), 168–173 (1974)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bakhouya, M., Serres, O., El-Ghazawi, T. (2008). A PGAS-Based Algorithm for the Longest Common Subsequence Problem. In: Luque, E., Margalef, T., Benítez, D. (eds) Euro-Par 2008 – Parallel Processing. Euro-Par 2008. Lecture Notes in Computer Science, vol 5168. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85451-7_70
Download citation
DOI: https://doi.org/10.1007/978-3-540-85451-7_70
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85450-0
Online ISBN: 978-3-540-85451-7
eBook Packages: Computer ScienceComputer Science (R0)