Accelerating DNA analysis applications on GPU clusters

  • Authors:
  • Antonino Tumeo;Oreste Villa

  • Affiliations:
  • High Performance Computing, Pacific Northwest National Laboratory, Richland, WA, USA;High Performance Computing, Pacific Northwest National Laboratory, Richland, WA, USA

  • Venue:
  • SASP '10 Proceedings of the 2010 IEEE 8th Symposium on Application Specific Processors (SASP)
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

DNA analysis is an emerging application of high performance bioinformatics. Modern sequencing machinery are able to provide, in few hours, large input streams of data which needs to be matched against exponentially growing databases of known fragments. The ability to recognize these patterns effectively and fastly may allow extending the scale and the reach of the investigations performed by biology scientists. Aho-Corasick is an exact, multiple pattern matching algorithm often at the base of this application. In this paper we present an efficient implementation of the Aho-Corasick algorithm for high performance clusters accelerated with Graphic Processing Units (GPUs). We discuss how we partitioned and adapted the algorithm to fit the Tesla C1060 GPU and then present a MPI based implementation for a heterogeneous high performance cluster. We compare this implementation to MPI and MPI with pthreads based implementations for a homogeneous cluster of x86 processors, discussing the stability vs. the performance and the scaling of the solutions, taking into consideration aspects such as the bandwidth among the different nodes.