Question

2- Given s set of n numbers A = (a1, a2, a3...., an] we want to compute the all sums of the form a1, al+a2,
al+a2+a3, al+a2+a3+a4, al+a2+...an.
KS
1.
Describe a sequential algorithm that accept the A array and produce an array S where
S[i]=a1+a2+...ai. Provide detailed explanation and illustrative figure for your algorithm.
Compute the time complexity of you proposed sequential algorithm.
Assuming we have P processor, propose a parallel algorithm for this problem. Provide detailed
explanation and illustrative figure (see slide #21,22 Chapter 1-TimeComplexity Analysis) for your
algorithm with a fixed P value (for example P=4) and sample input set.
Compute the time complexity of you proposed parallel algorithm.
How much the parallel algorithm is faster than the sequential algorithm.
IV.
V.
► If we have P<N/2 core:
If we have PEN core:
Phase: 1
55
8
9
2
Z 14. 87 124
21
Processer
Processor 2
Processor 3
po
p1
p2
pu
D4
Array ABS
2
7
24
9
local_min
local min
local min
po
рт
7
9
Phase: 2
ро
2
9
Same Problem with
Smaller (P) Size
ро
22
Encioncy Complety
21
ChooneyComplety​

Answer 1

Answer:

cvvfhx hxhsbu txg b fshxe gzj r