QUESTION 49 1 points Save Answer The tree structured implementation of the barrier routine has time complexity (where P is the number of processes) O A. O(P) ○ B. 0(PlogP) O D. O(logP)
D. O(logP). Reason– In n – tree based implementation, there is local subgrouping of procecces into groups of n. So by this way the processes are executed in logP complexity. Because each time the number of processes become half.
A. 2log2(n). This is because, a tree based implementation of barrier has two parts. The first part is the arrival phase. Here there is grouping of processes, and it takes log2(n) steps for this phase. Then comes the departure phase where they again split in an orderly format. which has log2(n) steps. So total is 2log2(n)
Q 56. O(P). Central counter method maintain a single counter. The access to this counter by all processes are searlized, It is linear in nature, hence O(P)