Parallel addition

Parallel addition - Parallelizing Algorithms 1 Add a set of...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Title: Parallel addition Date: August 28, 2007 9:30 AM Category: CprE426 Tags: Small game: come up with a classic american movie that you think many people have seen Terminator Matrix * King Kong Star Wars # the most watched Wizard of Oz Forest Gump The Godfather How did you come up with you're groups choice? Did you come up with it as a  computer scientist. Now come up with a short description of StarWars: In a Galaxy Far Far Away, a teenage farmer comes of age and blows up an  evil spaceship, saving the universe. farmer saves universe, blows up evil spaceship Now come up with 2-3 words that describe class last week Linear Algebra Algorithms modeling computation Mathematical Modeling of Real-World Problems Paralleizable problem solving Modeling and Estimation in Problem Solving Modeling, Estimating Classes of Computation Numeric Systems of equations permutations and combinations Symbolic How much time a serial calculation will take
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Parallelizing Algorithms 1. Add a set of numbers 2. Multiply a set of numbers 3. Evaluate a polynomial 4. Dot product of two vectors n: problem size p: processors 1. serial (n-1) parallel (n-p)/p + p-1 2. serial (n-1) parallel (n-p)/p + p-1 3. serial n parallel n/p 4. serial n parallel n/p Concrete example n = 128 numbers p = 8 processors 1. Each processor processes a share of numbers n/p - 1 2. [5] [3] [11] [9] [4] [-1] [0] [5] each processor has a number 3. [8] [x] [20] [x] [3] [x] [5] [x] pair each for a result (+1 add, +1 communication) 4. [28] [x] [x] [x] [8] [x] [x] [x] again (+1 add, +1 communication) 5. [36] [x] [x] [x] [x] [x] [x] [x] again (+1 add, +1 communication) so-- (n/p-1) + 2 * log2(p) (assuming additions and communications are the same unit of time...
View Full Document

This note was uploaded on 03/27/2008 for the course CPRE 526 taught by Professor Kothari during the Fall '07 term at Iowa State.

Page1 / 2

Parallel addition - Parallelizing Algorithms 1 Add a set of...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online