SparkBLAST: scalable BLAST processing using in-memory operations
Related Experiment Video
Updated: Feb 27, 2026

Blast Quantification Using Hopkinson Pressure Bars
Published on: July 5, 2016
Marcelo Rodrigo de Castro1, Catherine Dos Santos Tostes2, Alberto M R Dávila2
1Computer Science Department, Federal University of São Carlos, Rod. Washington Luís, Km 235, São Carlos, 21040-900, Brazil.
Background:
The demand for processing ever increasing amounts of genomic data has raised new challenges for the implementation of highly scalable and efficient computational systems. In this paper we propose SparkBLAST, a parallelization of a sequence alignment application (BLAST) that employs cloud computing for the provisioning of computational resources and Apache Spark as the coordination framework. As a proof of concept, some radionuclide-resistant bacterial genomes were selected for similarity analysis.
Results:
Experiments in Google and Microsoft Azure clouds demonstrated that SparkBLAST outperforms an equivalent system implemented on Hadoop in terms of speedup and execution times.
Conclusions:
The superior performance of SparkBLAST is mainly due to the in-memory operations available through the Spark framework, consequently reducing the number of local I/O operations required for distributed BLAST processing.
Related Concept Videos
Parallel Processing
Maximum Size of Aggregate

