Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.

Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.

Like this presentation? Why not share!

- Matrix multiplicationdesign by Respa Peter 448 views
- Dynamic programming1 by debolina13 887 views
- Matrix multiplication by International Isl... 3044 views
- Matrix Multiplication(An example of... by Pramit Kumar 47583 views
- Dynamic Programming - Matrix Chain ... by Pecha Inc. 2007 views
- Dynamic programming in Algorithm An... by Rajendran 121 views

927 views

Published on

No Downloads

Total views

927

On SlideShare

0

From Embeds

0

Number of Embeds

121

Shares

0

Downloads

21

Comments

0

Likes

1

No embeds

No notes for slide

- 1. Dynamic Programming on SIMD
- 2. SIMD (SSE)A register has say Example 4 parts, each x:=x+ypart has 8 bits or 16 bits x,y are memory locations of Each part appropriate alignment and executes the each refers to 4 differentsame operation variables but in parallel
- 3. Edit Distance between Strings Q D Edit distancebetween Q[1..j] and D[1..i]
- 4. E(i,j)
- 5. F(i,j)
- 6. Summarizing A G C T A -1 2 2 2 G 2 -1 2 2 C 2 2 -1 2 T 2 2 2 -1
- 7. Parallel Computing Find the max value path fromMismatch each location to the top left corner Insertion in Q Insertion in D
- 8. Parallel Computing Anti-diagonal can bedone inparallel
- 9. SIMD? One SIMD register can handle all values in this chunk Partition intochunks, each chunkshould have proper alignment
- 10. Fix: Go VerticalPartition into vertical chunks, each chunk should have proper alignment
- 11. Problem 1: Boundaries One value comes from the previous chunkEach chunk needs a shift
- 12. Solution 1: Striping x’s belong to onechunk, y’s to another and so on
- 13. Problem 2: Computing F At most number of blocksSequential Dependency
- 14. Problem 2: Computing FSequential Dependency
- 15. Thank You

No public clipboards found for this slide

×
### Save the most important slides with Clipping

Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.

Be the first to comment