{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Polynomial Evaluation, Paralllel Prefix

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

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

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) so--

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### 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
Ask a homework question - tutors are online