Question: Need Good Explanation on Broadcasting a DatumWith Explaining the given example. And proper Dry Run ofBroadcasting Algorithm With Explanation and Example of your own formore explanation. And Finally, Explain Analysis in detail. I needhelp in understanding the concept so those who really haveknowledge of this only answer.
- Parallel Computing Question Need Good Explanation On Broadcasting A Datum With Explaining The Given Example And Proper 1 (52.93 KiB) Viewed 39 times
- Parallel Computing Question Need Good Explanation On Broadcasting A Datum With Explaining The Given Example And Proper 2 (39.68 KiB) Viewed 39 times
- Parallel Computing Question Need Good Explanation On Broadcasting A Datum With Explaining The Given Example And Proper 3 (33.47 KiB) Viewed 39 times
- Parallel Computing Question Need Good Explanation On Broadcasting A Datum With Explaining The Given Example And Proper 4 (42.95 KiB) Viewed 39 times
Broadcasting a Datum It is possible to simulate the concurrent read and write operations at a price of O(log₂n) time. The algorithm used in these situations is known as broadcasting. Let D be a location in shared memory holding a datum that all n processors need at a given moment during the execution of an algorithm. Let n = 2k We shall assume that an array L of length n is present in memory. The array is initially empty and its ith position is denoted by L.
Broadcasting the value X = 5 in log₂n steps Hrn CO 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 I [1:n] 5 P₁ 55 P₁ 5 5 5 5 P3 P1 5 5 5 5 5 5 5 5 III Ps P6 P, P3 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 P, P10... P15 P16
Broadcasting Algorithm Processor P₁ reads the value in D stores it in its local memory writes it in L[1] for i 0 to log₂n 1 do for j2¹ + 1 to 2¹+1 do in Parallel - Processor P₁ reads the value in L[j-2¹] stores it in its local memory writes it in L[j]|
Analysis When the algorithm terminates, all processors have stored the value of D in their local memories for later use. • Since the number of processors having read D doubles in each iteration, the procedure terminates in O(log₂n) time. • The memory requirement of Broadcast is an array of length n. M[0] M[1] M[2] M[3] M[4] M[5] M[6] M[7] Po P₁ P₁₂ Ps B