Register

programme running time made easy mock 2

611 views
1 1 vote
A particular parallel program computation requires 100 ns when executed on a single processor. If 20 percent of this computation is sequential then the execution time for this program running with 4 processors is _______________ (in ns).

1 Answer

Best answer
3 3 votes
20ns is sequential. We can't do anything about it.

 

Rest 80ns can be divided among 4 processor to be done in parallel. So each processor will take 20ns. All running in parallel will take overall 20ns.

 

So total time=> 20+20=40ns
• edited by
Voting & Accepting an answer helps improve the community
← Previous · output of LEDNext → · Virtual Gate Test Se...
← Previous in category · PipelineNext in category → · COA_RAW DEPENDENCY
Position:
Show:

Related questions

4 4 votes
5 answers 5 answers
23.5k
23.5k views
worst_engineer asked Oct 7, 2015
23,490 views
The running time of an algorithm is given by T(n) = T(n-1) + T(n-2) - T(n-3) , if n>3
The running time of an algorithm is given by\[T(n)=T(n-1)+T(n-2)-T(n-3) \text {, if } n \geqslant 3\]n, otherwise.The order is :n$\log n$$\mathrm{n}^{n}$$n^{2}$
0 0 votes
1 answers 1 answer
4.2k
4.2k views
Hardik Vagadia asked Aug 2, 2015
4,194 views
What is the smallest value of n such that an algorithm whose running time is 100n^2 runs faster than an algorithm whose running time is 2^n on the same machine?
0 0 votes
1 1 answer
818
818 views
usdid asked Jul 2, 2022
818 views
 what is the running time of the following iterative algorithm? b) It is possible to talk about the best, average and worst running times for this algorithm. Why?
what is the running time of the following iterative algorithm?b) It is possible to talk about the best, average and worst running times for this algorithm. Why? pseudo co...