By Topic

Evaluating BLAST Runtime Using NAS-Based High Performance Clusters

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)

The Basic Local Alignment Search (BLAST) is one of the most widely used bioinformatics programs for searching all available sequence databases for similarities between a protein or DNA query and predefined sequences, using sequence alignment technique. Recently, many attempts have been made to make the algorithm practical to run against the publicly available genome databases on large parallel clusters. This paper presents our experience in evaluating both the serial and parallel BLAST algorithms onto a large Infiniband-based diskless High Performance Cluster (HPC) that offers lower hardware cost and improved reliability, as opposed to traditional disk full clusters. The paper also presents the evaluation methodology along with the experimental results to illustrate the scalability of the BLAST algorithm on our HPC system. For our measurement and comparison, we considered cluster sizes up to 32 compute nodes. Our results show that BLAST runtime can still be retained with the use of the diskless clusters, while improving the runtime reliability.

Published in:

Computational Intelligence, Modelling and Simulation (CIMSiM), 2011 Third International Conference on

Date of Conference:

20-22 Sept. 2011