Title
Evaluating Performance Optimizations Of Large-Scale Genomic Sequence Search Applications: Using Sst/Macro
Keywords
Exascale architecture simulator; MpiBLAST; Performance and scalability modeling
Abstract
The next decade will see a rapid evolution of HPC node architectures as power and cooling constraints are limiting increases in microprocessor clock speeds and constraining data movement. Future and current HPC applications will have to change and adapt as node architectures evolve. The application of advanced cycle accurate node architecture simulators will play a crucial role for the design and optimization of future data intensive applications. In this paper, we present our simulation-based framework for analyzing the scalability and performance of a number of critical optimizations of a massively parallel genomic search application, mpiBLAST, using an advanced macroscale simulator (SST/macro). In this paper we report the use of our framework for the evaluation of three potential improvements of mpiBLAST: enabling high-performance parallel output, an approach for caching database fragments in memory, and a methodology for pre-distributing database segments. In our experimental setup, we performed query sequence matching on the genome of the yellow fever mosquito, Aedes aegypti.
Publication Date
9-14-2011
Publication Title
SIMULTECH 2011 - Proceedings of 1st International Conference on Simulation and Modeling Methodologies, Technologies and Applications
Number of Pages
65-73
Document Type
Article; Proceedings Paper
Personal Identifier
scopus
Copyright Status
Unknown
Socpus ID
80052580777 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/80052580777
STARS Citation
Ahn, Tae Hyuk; Dechev, Damian; Lin, Heshan; Adalsteinsson, Helgi; and Janssen, Curtis, "Evaluating Performance Optimizations Of Large-Scale Genomic Sequence Search Applications: Using Sst/Macro" (2011). Scopus Export 2010-2014. 2854.
https://stars.library.ucf.edu/scopus2010/2854