info@avatto.com
+91-9920808017
0. Suppose a program created a binary search tree (BST) with 1000 nodes. We are performing some basic operations (insert, remove, search) on a BST infinitely often by using the program. The probability to perform each operation is same. If we use the the following multi threading technique(s) while performing operations on BST. I. Coarse-Grain Multi threading II. Fine-Grain Multi threading Which multi threading technique(s) give better throughput?(Assume that program is running on a 8-core multiprocessor)
I only
II only
I and II give same throughput
None
You must be logged in to post a comment.
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
You must be logged in to post a comment.