Question

3.22 Suppose there are M tasks that are being mapped using a
centralized dynamic load balancing scheme and we have the
following information about these tasks:

Average task size is 1.
Minimum task size is 0.
Maximum task size is m.
It takes a process D time to pick up a task.

Compute the best- and worst-case speedups for self-scheduling and
chunk-scheduling assuming that tasks are available in batches
of l (l < M). What are the actual values of the best- and
worst-case speedups for the two scheduling methods when p = 10, D
= 0.2, m = 20, M = 100, and l = 2?