Gant Chart for SRTF algorithms

Show working and explain your answer.

a) The runtime of a single MPI Broadcast() operation involving p processors is ii) Ω(p) iii) N(Öp) iv) N(log p) i) Answer: b) The runtime of MPI Allreduce() operation involving p processors is ii) Ω(p) iii) Q(Öp) iv) N(log p) i) (p log p) Answer: (p log p)

2. If today's workstations execute at 10° operations per second, and performance increases at a rate of 20 percent per year, how long will it be before we have workstations capable of 10° operations per second? 101 operations per second? 3. А climate model requires total 1016 floating point operations for a ten-year simulation. How long would this computation take on a computer capable of 107 floating point operations per second (10 Mflops)?

Modify Algorithms so that they work for any number of processes,not just the powers of 2. 1. procedure ONE_TO_ALL_BC(d, my_id, X)2. begin3. mask := 2d - 1; /* Set all d bits of mask to 1 */4. for i := d - 1 downto 0 do /* Outer loop */5. mask := mask XOR 2i; /* Set bit i of mask to 0 */6. if (my_id AND mask) = 0 then /* If lower i bits of my_id are 0 */7. if (my_id AND 2i) = 0 then8. msg_destination := my_id XOR 2i;9. send X to msg_destination;10. else11. msg_source := my_id XOR 2i;12. receive X from msg_source;13. endelse;14. endif;15. endfor;16. end ONE_TO_ALL_BC

Describe the Discrete Fast Fourier Transform algorithm and comment on its computational complexity. How does it relate to the divide and conquer strategy implemention wise?

Answer as soon as possible

Select the order of the algorithm for each growth-rate function (assuming that there are n inputs):  5 log n + 6n 5n log_2 n + 6n + 7n^2 5n + 9k 5n log_2 n + 6n 4n^3 - 2n 5 log_2 n + 6 42 + 99k   Options: 1. O(1) 2. O(log n) 3. O(n log n) 4. O(n) 5. O(n^2) 6. O(n^3) 7. O(nm)

CS Theory & System Fundamentals For a multi-threaded algorithm; In what situations does running time depend more on work than on span?   Explain. In what situations (if any) does running time depend more on span than on work? Explain. Suppose that for a particular algorithm the work is O(n2) and the span is O(n). What can you say about how the running time will be affected when n is doubled?   Explain.

QUESTION 11 Algorithm one has time complexity f, that is O(n°) and algorithm two has time complixity f2 that is 0(10n°). Which algorithm is faster for large inputs? Algorithm one is faster. Algorithm two is faster. The two algorithms are equally fast. We can not tell from the information given.