1. ( problem 3.2 ) For the task graphs in the given abouve figure, determine the

Question

1. ( problem 3.2 ) For the task graphs in the given abouve figure, determine the following :

             a.) Maximum degree of concurrency

             b.) Critial path length

             c.) Maximum achievable speedup over one process assuming that an arbitrarily large

                     number of processes is available.

             d.) The minimum number of processes needed to obtain the maximum possible speed

                     up.

e.) The maximum achievable speedup if the number of processes is limited to (a) 2, (b) 4, and c.) 8

) .

Explanation / Answer

Therefore    for    graph a) Maximum Degree of Concurrency is : 8

2)Critical Path Length: It is defined as the longest length in the graph.

             Therefore    for    graph

Therefore for graph

Related Questions

Navigate

• Browse (All)
• Browse 1
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.