Building a Bioinformatics Supercomputing Cluster
Our local cluster is able to search an up-to-date database with fewer concurrent users and better overall throughput times than is the NCBI Web site. Simple wall-clock time trials were performed using our cluster and the NCBI Web site. We used eight simple queries consisting of protein and DNA sequences. A timer was started after submitting a query from the Web site and stopped once the results were displayed in the browser window. Trials on the NCBI Web site were performed at various times throughout the span of two weeks. All eight trials were averaged and compared to the cluster's times. The purpose of timing the query from the point of submission until the results are displayed was to observe times that an actual user would incur. On average, the cluster took less time to complete a query.
Resources for this article: /article/8140.
Josh Stroschein (email@example.com) currently is pursuing his undergraduate degree in Computer Science and Criminal Justice. Josh is working on the cluster project through a grant at USD. He also works for Walton Internet Solutions, based in Vermillion, SD.
Doug Jennewein (firstname.lastname@example.org) is a research analyst in Computer Science, and he has been with the USD since 1998. He received his Masters degree in Computer Science from USD in 2004. Doug's main research interest is high performance computing.
Joe Reynoldson (email@example.com) is the research computing manager/instructor for the Computer Science Department, and he has been with USD since 1994. He received his Masters degree in Computer Science from USD in 1997. Joe teaches topics in Perl, systems management and Web development.
- Smoothwall Express
- Machine Learning Everywhere
- Bash Shell Script: Building a Better March Madness Bracket
- Own Your DNS Data
- Simple Server Hardening
- Understanding OpenStack's Success
- From vs. to + for Microsoft and Linux
- The Weather Outside Is Frightful (Or Is It?)
- Understanding Firewalld in Multi-Zone Configurations
- Ensono M.O.