Rewrite Matrix Add Task and Matrix Task to use an executor service.
Consider the following code for an in-place merge-sort:
(Here, submit ()starts the task and immediately returns, and a wait Termination()waits until all submitted tasks have finished.)Assuming that the merge method has no internal parallelism, give the work, span, and parallelism of this algorithm. Give your answers both as recurrences and as(f (n)), for some function f.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here