Suppose the structure of a computation consists of a binary tree with n leaves (final tasks) and logn levels. Each node in the tree consists of one computational step. What is the lower bound of the execution time if the number of processors is less than n?
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here