Assume that instead of having only a single processor, you have 100. Design a parallel algorithm that utilizes these additional resources to speed up the solution to the previous computation. Exactly how much faster would your parallel summation algorithm execute than the sequential one

Parallel summation algorithm performs 14 times faster than the sequential algorithm.

Explanation:

An algorithm is a step by step procedure to solve a specific problem.

The processor can process the data either sequentially (sequential) or concurrently (parallel).

Algorithm:

1. Initially, set the value of i to 1

2. Set the value of sum to 0

3. While i less than 101 do

4. Iterate ( see attached iteration from iteration 1 to Iteration 7)

5. End of the loop

6. Print the sum value

7. Stop

The above parallel algorithm needs seven iteration. One pair contains two values, hence multiply by 2.

parallel summation algorithm performs 14 times faster than the sequential algorithm.

With the execution, parallel summation algorithm does not require 100 processors but 50 processors is just enough because that is what is needed for parallel summation algorithm.

answer; insolated i/o uses separate memory space,and on the other hand memory mapped i/o uses memory from the main