Sequence Alignment with GPU: Performance and Design Challenges - PowerPoint PPT Presentation

1 / 14
About This Presentation
Title:

Sequence Alignment with GPU: Performance and Design Challenges

Description:

Software Architecture (Smith-Waterman) Parallelization Strategy. Results. Outline. Motivation ... Learn the GPU architecture and its intricacies ... – PowerPoint PPT presentation

Number of Views:26
Avg rating:3.0/5.0
Slides: 15
Provided by: wind186
Category:

less

Transcript and Presenter's Notes

Title: Sequence Alignment with GPU: Performance and Design Challenges


1
Sequence Alignment with GPU Performance and
Design Challenges
  • Gregory M. Striemer and Ali Akoglu
  • gmstrie, akoglu_at_ece.arizona.edu
  • Reconfigurable Computing Lab
  • Department of Electrical and Computer Engineering
  • University of Arizona

2
Outline
  • Motivation
  • Project Goals
  • Hardware Architecture (Tesla GPU)
  • Software Architecture (Smith-Waterman)
  • Parallelization Strategy
  • Results

3
Motivation
4
Project Goals
  • Explore the GPU as a massively parallelized
    scientific computing device
  • Learn the GPU architecture and its intricacies
  • Study how programs must be parallelized to work
    with the GPU architecture
  • Find ways to exploit GPU memory hierarchy
  • Mapping software architecture onto hardware
    architecture
  • Demonstrate the feasibility of mapping software
    architectures to the GPU and the drawbacks
  • Explore what makes software architectures
    suitable for the GPU
  • Run software purely on the GPU
  • Design software mapping to be scalable

5
Hardware Architecture
1.5 GB
8 KB
8 KB
16 KB
6
Sequence Alignment
  • Hij max
  • Hi-1,j-1 Si,j,
  • Hi-1,j G,
  • Hi,j-1 G,
  • 0 //G 10

Substituion Matrix
7
State of the Art Manavski and Farrar
Implementation
  • Farrar
  • CPU must have SSE2 SIMD support. Not compatible
    with AMD
  • Does not utilize larger register size supported
    by SSE3
  • Requires large amounts of memory to store
    substitution table created from substitution
    matrix and query sequence
  • Manavski
  • Poor memory utilization of GPU
  • Query Sequences are limited to 356 characters in
    length.
  • Highly CPU Dependent
  • Not scalable
  • Requires large amounts of memory to store
    substitution table created from substitution
    matrix and query sequence

8
Cost Function
New Cost Function
Previous Methods
Computed new table from substitution matrix with
substitution characters for top row and query
sequence for column
Does not use modulo
Sorted Substitution Table
Only need space for 26x26 matrix
Space needed is 23x(Query Length)
9
Parallelization
10
Results
Alignment Database Swissprot (Aug 2008),
containing 392,768 sequences. GSW vs SSEARCH.
11
Results
Alignment Database Swissprot (Aug 2008),
containing 392,768 sequences. GSW vs Farrar.
12
Questions
13
Results
Farrars SIMD Implementation
14
TESLA Architecture
Write a Comment
User Comments (0)
About PowerShow.com