Presentation is loading. Please wait.

Presentation is loading. Please wait.

Parallel System for BLAST

Published byNgô Tô Modified over 6 years ago

Similar presentations

Presentation on theme: "Parallel System for BLAST"— Presentation transcript:

1 Parallel System for BLAST
Department of Computer Engineering Chulalongkorn University ประภาส จงสถิตย์วัฒนา วรินทร์ วัฒนพรพรหม

2 Introduction What is BLAST? BLAST – Basic Local Alignment Search Tools
matches between genetic materials or proteins Helps scientists to make inferences about the structures and functions of proteins screen new sequences for further investigation

3 Introduction Problem found
takes a very long time to search a large number of queries in a large database genome databases are enormous and doubling in size every 1.3 years

4 Background Knowledge DNA

5 Background Knowledge Gene Finding Search by contents Search by signal
Search by Sequence Similarity (BLAST)

6 Background Knowledge BLAST

7 Background Knowledge BLAST Algorithm

8 Background Knowledge BLAST Algorithm blastn -> Compare DNA bases
blastx -> Compare proteins for all 6 reading frames

9 Background Knowledge BLAST Algorithm
T T C T C G G A C C T G G A G A T T C A C A G T A A G A G C C T G G A C C T C T A A G T G T C A A A G A G C C T G G A C C T C T A A G T G T C T T T C T C G G A C C T G G A G A T T C A C A G T T T C T C G G A C C T G G A G A T T C A C A G U T T C T C G G A C C T G G A G A T T C A C A G U

10 Performance in memory search limited memory faster CPU

11 Cache memory small and fast to access memory embeded on the same chip as CPU store DATA and PROGRAM make CPU access DATA upto 10 times faster

12 Preliminary Study

13 Preliminary Study No. of Cut DB Part No. DB size (MB) Time used (min)
Time used to concat (min) Total time used (min) 1 234 70 2 109 17 38 125 20 3 100 16 1.5 38.5 15 34

14 Time(Original) Time(Improved)
Preliminary Study Speedup Improved System Time(Original) Time(Improved) SpeedUp = = 351/(180+5) = 1.9 times

15 Parallel BLAST separate Databases separate Queries hybrid

16 Parallel System for BLAST
Parallel Query Improving the performance of BLAST in a Memory Limited Environment

17 Parallel System for BLAST

18 Parallel System for BLAST
Considerations Compatibility Scalability Fault-tolerance Flexibility

19 Parallel System for BLAST
Processes Preprocessing Splitting database, Distribute, and create index for each of them Splitting queries Distributing Query Distribute the splited query to each node Postprocessing Merge the searched output together

20 Parallel System for BLAST
Data Structure ... … : .:. DB1 DB2 DBn Max Clients Number of databases

21 Parallel System for BLAST
Data Structure … Sequence1 Sequence2 : .:. Sequencen DB1 DB2 DBn Number of Sequences Number of databases

22 Parallel System for BLAST
BLASTServer

23 Parallel System for BLAST
BLASTClient

24 Parallel System for BLAST
-1 CID02 CID03 CID04 CID05 CID06 CID01 CID02 CID03 CID04 CID05 CID02 CID03 CID04 CID05 CID01 CID02 CID03 CID04 -1 CID02 CID03 CID04 CID05 -1 CID02 CID03 CID04 -1 CID04 CID02 CID05 CID03 CID06 CID01 CID02 CID03 CID01 CID06 CID02 CID03 CID04 CID05 CID01 CID02 BLASTClient no CID01-05 registers respectively BLASTClient no CID06 registers and was assign a task 2 1 4 3 BLASTServer assign tasks to each client Tasks for DB1 have been finished, BLASTClient no CID05 and CID06 was assign a new Database Each BLASTClient finish its task and request for a new task Tasks for DB2 and DB3 have been finished BLASTClient no CID01 disconnect from the System Each BLASTClient finish its task and request for a new task Seq1 -1 Seq2 Seq3 CID02 CID03 CID04 Seq4 Seq5 Seq6 Seq1 -1 Seq2 Seq3 Seq4 Seq5 CID04 Seq6 Seq1 -1 Seq2 Seq3 Seq4 Seq5 CID04 Seq6 CID02 Seq1 -1 Seq2 Seq3 CID05 CID02 CID03 CID04 Seq4 Seq5 CID06 Seq6 Seq1 -1 Seq2 Seq3 CID02 CID03 CID04 Seq4 CID05 CID06 Seq5 Seq6 Seq1 -1 Seq2 CID02 CID03 CID04 Seq3 Seq4 CID05 Seq5 Seq6 Seq1 -1 CID03 CID04 Seq2 CID05 CID02 Seq3 CID01 Seq4 Seq5 Seq6 Seq1 -1 CID02 CID03 CID04 Seq2 CID05 Seq3 CID01 Seq4 Seq5 Seq6 Seq5 Seq4 Seq6 Seq3 CID05 Seq2 CID04 CID03 CID02 CID01 Seq1 Seq1 Seq2 Seq3 Seq4 Seq5 Seq6 Seq1 -1 CID04 Seq2 CID05 CID02 CID03 Seq3 CID01 Seq4 Seq5 Seq6 Seq1 -1 Seq2 CID05 CID02 CID03 CID04 Seq3 CID01 Seq4 Seq5 Seq6 Seq1 -1 Seq2 CID04 Seq3 CID05 CID02 CID03 Seq4 Seq5 Seq6 Seq1 -1 Seq2 CID03 CID04 Seq3 CID05 CID02 Seq4 Seq5 Seq6 Seq1 -1 Seq2 CID03 CID04 Seq3 CID02 Seq4 CID05 Seq5 Seq6 Seq1 -1 Seq2 Seq3 CID05 CID02 CID03 CID04 Seq4 Seq5 Seq6 Seq1 -1 Seq2 CID02 CID03 CID04 Seq3 CID01 Seq4 CID05 Seq5 Seq6 2 1 4 3

25 Pre processing Time (min) Post processing Time (min)
Performance No of BlastClient Pre processing Time (min) Search Time (min) Post processing Time (min) Total Time (min) Speed up (times) 1 5 421 10 436 1.84 2 191 206 3.9 3 122 137 5.8 4 88 103 7.8 78 93 8.6 6 65 80 7 58 73 11 8 51 66 12

26 Performance

27 Performance

28 Performance

29 Performance

30 Performance

31 Conclusion The Superlinear speedup gain from the eliminating of the swapping time The performance of the system is limited due to the preprocessing and postprocessing still be sequential tasks.

32 Suggestions for further study
Should be able to support more BLAST algorithms and parameters Recovery system incase of BLASTServer or SharedStorage crashes Estimate the search time Improve the performance by eliminating the sequential tasks Dynamic database distribution during search

33 More Information Master thesis: Warin Wattanapornprom
A parallel processing system for a BLAST program Faculty of Engineering, Chulalongkorn University, 2002 ISBN

34 Thank you for your attention

Download ppt "Parallel System for BLAST"

Similar presentations

Www.cs.rmit.edu.au/eCDS Dynamic Task Assignment Load Index for Geographically Distributed Web Services PhD Research Proposal By: Dhiah Al-Shammary Supervised.

Dynamic Task Assignment Load Index for Geographically Distributed Web Services PhD Research Proposal By: Dhiah Al-Shammary Supervised.
28 April, 2005ISGC 2005, Taiwan The Efficient Handling of BLAST Applications on the GRID Hurng-Chun Lee 1 and Jakub Moscicki 2 1 Academia Sinica Computing.

28 April, 2005ISGC 2005, Taiwan The Efficient Handling of BLAST Applications on the GRID Hurng-Chun Lee 1 and Jakub Moscicki 2 1 Academia Sinica Computing.
Reference-based Indexing of Sequence Databases Jayendra Venkateswaran, Deepak Lachwani, Tamer Kahveci, Christopher Jermaine University of Florida-Gainesville.

Reference-based Indexing of Sequence Databases Jayendra Venkateswaran, Deepak Lachwani, Tamer Kahveci, Christopher Jermaine University of Florida-Gainesville.
Bioinformatics Tutorial I BLAST and Sequence Alignment.

Bioinformatics Tutorial I BLAST and Sequence Alignment.
BLAST Sequence alignment, E-value & Extreme value distribution.

BLAST Sequence alignment, E-value & Extreme value distribution.
Local alignments Seq X: Seq Y:. Local alignment  What’s local? –Allow only parts of the sequence to match –Results in High Scoring Segments –Locally.

Local alignments Seq X: Seq Y:. Local alignment  What’s local? –Allow only parts of the sequence to match –Results in High Scoring Segments –Locally.
Bioinformatics at USDA-ARS Livestock Issues Research Unit Scot E. Dowd, Joaquin Zaragoza Mel Oliver and Paxton Payton.

Bioinformatics at USDA-ARS Livestock Issues Research Unit Scot E. Dowd, Joaquin Zaragoza Mel Oliver and Paxton Payton.
1 SC'03, Nov. 15–21, 2003 A Million-Fold Speed Improvement in Genomic Repeats Detection John W. Romein Jaap Heringa Henri E. Bal Vrije Universiteit, Amsterdam.

1 SC'03, Nov. 15–21, 2003 A Million-Fold Speed Improvement in Genomic Repeats Detection John W. Romein Jaap Heringa Henri E. Bal Vrije Universiteit, Amsterdam.
TurboBLAST: A Parallel Implementation of BLAST Built on the TurboHub Bin Gan CMSC 838 Presentation.

TurboBLAST: A Parallel Implementation of BLAST Built on the TurboHub Bin Gan CMSC 838 Presentation.
Tree Pattern Matching in Phylogenetic Trees Automatic Search for Orthologs or Paralogs in Homologous Gene Sequence Databases By: Jean-François Dufayard,

Tree Pattern Matching in Phylogenetic Trees Automatic Search for Orthologs or Paralogs in Homologous Gene Sequence Databases By: Jean-François Dufayard,
1 Bio-Sequence Analysis with Cradle’s 3SoC™ Software Scalable System on Chip Xiandong Meng, Vipin Chaudhary Parallel and Distributed Computing Lab Wayne.

1 Bio-Sequence Analysis with Cradle’s 3SoC™ Software Scalable System on Chip Xiandong Meng, Vipin Chaudhary Parallel and Distributed Computing Lab Wayne.
2/11/2004 Internet Services Overview February 11, 2004.

2/11/2004 Internet Services Overview February 11, 2004.
Cluster Computer For Bioinformatics Applications Nile University, Bioinformatics Group. Hisham Adel 2008.

Cluster Computer For Bioinformatics Applications Nile University, Bioinformatics Group. Hisham Adel 2008.
Sequence alignment, E-value & Extreme value distribution

Sequence alignment, E-value & Extreme value distribution
Knight’s Tour Distributed Problem Solving Knight’s Tour Yoav Kasorla Izhaq Shohat.

Knight’s Tour Distributed Problem Solving Knight’s Tour Yoav Kasorla Izhaq Shohat.
07/14/08. 2 Points Introduction. Cluster and Supercomputers. Cluster Types and Advantages. Our Cluster. Cluster Performance. Cluster Computer for Basic.

07/14/08. 2 Points Introduction. Cluster and Supercomputers. Cluster Types and Advantages. Our Cluster. Cluster Performance. Cluster Computer for Basic.
Arabidopsis Gene Project GK-12 April Workshop Karolyn Giang and Dr. Mulligan.

Arabidopsis Gene Project GK-12 April Workshop Karolyn Giang and Dr. Mulligan.
How Parallelism Is Used In Bioinformatics Presented by: Laura L. Neureuter April 9, 2001 Using: Three Complimentary Approaches to Parallelization of Local.

How Parallelism Is Used In Bioinformatics Presented by: Laura L. Neureuter April 9, 2001 Using: Three Complimentary Approaches to Parallelization of Local.
BIONFORMATIC ALGORITHMS Ryan Tinsley Brandon Lile May 9th, 2014.

BIONFORMATIC ALGORITHMS Ryan Tinsley Brandon Lile May 9th, 2014.
Bigtable: A Distributed Storage System for Structured Data F. Chang, J. Dean, S. Ghemawat, W.C. Hsieh, D.A. Wallach M. Burrows, T. Chandra, A. Fikes, R.E.

Bigtable: A Distributed Storage System for Structured Data F. Chang, J. Dean, S. Ghemawat, W.C. Hsieh, D.A. Wallach M. Burrows, T. Chandra, A. Fikes, R.E.

Similar presentations

Ads by Google