Download presentation
Presentation is loading. Please wait.
Published byCamron Bryan Modified over 9 years ago
1
SPLITD Tom Madden NCBI
2
Problems Biological databases growing faster than computer memory. Fastest CPU’s get put into 1 or 2 CPU machines first. Most OS’s work better with fewer CPU’s in the box
3
Splitd solution Partition search so that it is spread over multiple machines. Break up database “virtually” so the number of chunks can be adjusted on the fly depending upon load, query, etc. HSP’s (start/stop/score) of alignments are calculated by backends. Tracebacks are calculated after merging.
4
Also… Use MSSQL to store queries and results rather than a home-grown system. Concatenate queries from different users ala megablast to minimize time spent scanning the database.
5
BD PD BD PD BD PD SD = SplitDaemon BD = blastsrvd+blastsrv4+nabrd PD = PartsDaemon MD =MergeDaemon FR = Formatter MD FR MSSQL20 SD MSSQL12 Blast.cgi FR Browser
6
BD PD BD PD BD PD SD = SplitDaemon BD = blastsrvd+blastsrv4+nabrd PD = PartsDaemon MD =MergeDaemon FR = Formatter MD FR MSSQL20 SD MSSQL12 Blast.cgi FR Browser
7
BD PD BD PD BD PD SD = SplitDaemon BD = blastsrvd+blastsrv4+nabrd PD = PartsDaemon MD =MergeDaemon FR = Formatter MD FR MSSQL20 SD MSSQL12 Blast.cgi FR Browser
8
BD PD BD PD BD PD SD = SplitDaemon BD = blastsrvd+blastsrv4+nabrd PD = PartsDaemon MD =MergeDaemon FR = Formatter MD FR MSSQL20 SD MSSQL12 Blast.cgi FR Browser hsp traceback
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.