Using the PGAS Programming Paradigm for Biological Sequence Alignment on a Chip Multi-Threading Architecture

The Partitioned Global Address Space (PGAS) programming paradigm offers ease-of-use in expressing parallelism through a global shared address space while emphasizing performance by providing locality awareness through the partitioning of this address space. Therefore, the interest in PGAS programming languages is growing and many new languages have emerged and are becoming ubiquitously available on nearly all modern parallel architectures. Recently, new parallel machines with multiple cores are designed for targeting high performance applications. Most of the efforts have gone into benchmarking but there are a few examples of real high performance applications running on multicore machines. In this paper, we present and evaluate a parallelization technique for implementing a local DNA sequence alignment algorithm using a PGAS based language, UPC (Unified Parallel C) on a chip multithreading architecture, the UltraSPARC T1. Keywords—Partitioned Global Address Space, Unified Parallel C, Multicore machines, Multi-threading Architecture, Sequence alignment.

[1]  Tarek A. El-Ghazawi,et al.  Towards a Complexity Model for Design and Analysis of PGAS-Based Algorithms , 2007, HPCC.

[2]  Mi Lu,et al.  Parallel Algorithms for the Longest Common Subsequence Problem , 1994, IEEE Trans. Parallel Distributed Syst..

[3]  A. S. Thoke,et al.  International Journal of Electrical and Computer Engineering 3:16 2008 Fault Classification of Double Circuit Transmission Line Using Artificial Neural Network , 2022 .

[4]  David A. Bader,et al.  A Graph-Theoretic Analysis of the Human Protein-Interaction Network Using Multicore Parallel Algorithms , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[5]  B. Schmidt,et al.  Biological Sequence Alignment on Graphics Processing Units , 2005 .

[6]  Nicholas Peter Pappas.  Searching Biological Sequence Databases Using Distributed Adaptive Computing , 2003 .

[7]  Tarek A. El-Ghazawi,et al.  Experimental Evaluation of Emerging Multi-core Architectures , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[8]  Ophir Frieder,et al.  Parallel computation in biological sequence analysis , 1998 .

[9]  Leslie G. Valiant,et al.  A bridging model for parallel computation , 1990, CACM.

[10]  Edson Cáceres,et al.  Parallel dynamic programming for solving the string editing problem on a CGM/BSP , 2002, SPAA '02.

[11]  David A. Bader,et al.  SWARM: A Parallel Programming Framework for Multicore Processors , 2007, IPDPS.

[12]  S. B. Needleman,et al.  A general method applicable to the search for similarities in the amino acid sequence of two proteins. , 1970, Journal of molecular biology.

[13]  Yixin Chen,et al.  A fast parallel algorithm for finding the longest common sequence of multiple biosequences , 2006, BMC Bioinformatics.

[14]  Edson Cáceres,et al.  A Parallel Wavefront Algorithm for Efficient Biological Sequence Comparison , 2003, ICCSA.

[15]  Tarek A. El-Ghazawi,et al.  Fast address translation techniques for distributed shared memory compilers , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[16]  Katherine Yelick,et al.  UPC: Distributed Shared-Memory Programming , 2003 .

[17]  M S Waterman,et al.  Identification of common molecular subsequences. , 1981, Journal of molecular biology.

[18]  David A. Bader,et al.  SWARM: A Parallel Programming Framework for Multicore Processors , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[19]  Jean Frédéric Myoupo,et al.  A coarse-grained multicomputer algorithm for the longest common subsequence problem , 2003, Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2003. Proceedings..