Polynomial Evaluation, Paralllel Prefix

Polynomial Evaluation, Paralllel Prefix - Title: Polynomial...

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

View Full Document Right Arrow Icon
Title: Polynomial Evaluation, Paralllel Prefix Date: August 30, 2007 9:38 AM Category: CprE426 Tags: Evaluate a polynomial n-1 multiplications to compute x^2, x^n n multiplications to multiply xi with ai n additions (2n-1) mult + n additions Can this be improved (serially) yes, first find an * x^n then add an-1 and multiply by x then add an-2 and multiply by x (continue) this is  n-1 mult + n additions Going back to addition,  can the previous parallel method be improved so that  each processor always have the sum? Previous example: 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] [xl] again (+1 add, +1 communication)
Background image of page 1

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

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

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

Page1 / 3

Polynomial Evaluation, Paralllel Prefix - Title: Polynomial...

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