Using SST/macro for effective analysis of mpi-based applications: Evaluating large-scale genomic sequence search

2Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Future and current high-performance computing applications will have to change and adapt as node architectures evolve. The application of advanced 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). We report the use of our framework for the evaluation of three potential improvements of mpiBLAST: 1) enabling high-performance parallel output; 2) an approach for caching database fragments in memory; and 3) 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. © 2013 IEEE.

Cite

CITATION STYLE

APA

Dechev, D., & Ahn, T. H. (2013). Using SST/macro for effective analysis of mpi-based applications: Evaluating large-scale genomic sequence search. IEEE Access, 1, 428–435. https://doi.org/10.1109/ACCESS.2013.2272434

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free