Calculate the product of following
8 integers using a parallel algorithm
Options
1H11
1112
1014
O none of the above
Clear Response
Answers
Answer:
ch pls tell and which class ?
Answer:
The Produt of the 8 integers using a parallel algorithm is 7
Step-by-step explanation:
The parallel algorithm for finding the sum of n integers or more generally applying a binary associative operation in a pairwise fashion to a list of elements is called reduce. Its work complexity is O(N) and its step complexity is O(log N). It is similar to adding them using a binary tree.
If we have 8 elements 1, 2, 3, 4, 5, 6, 7, and 8 they would be added in the following manner.
(((1*2) + (3*4)) + ((5*6) + (7*8)))
Solving one layer of parenthesis in one step. See that do this in three steps:
Do 1+2, 3+4, 5+6, and 7+8 in four threads. This is four computations.
Do 3 + 7, and 11 + 15 in two threads. These is two computations.
Do 10 + 26.
The total number of computations was 7, this scales linearly with n.