-- Nov 13 In-Class Exercise Thread
Suppose we have 24 machines and we want to return the top 20 documents with probability at least .999.
For m is the # of docs, n is the # of machines:
Case 1:
For m = 20, n = 16, then we return 7 docs
Case 2:
For m = 20, n = 32, then we return 9 docs
Since n = 24 is half way from 16 to 32, the number of docs should each machine compute their best results till is:
(7 + 9) / 2= 8 docs
(
Edited: 2019-11-13)
Suppose we have 24 machines and we want to return the top 20 documents with probability at least .999.
For m is the # of docs, n is the # of machines:
Case 1:
For m = 20, n = 16, then we return 7 docs
Case 2:
For m = 20, n = 32, then we return 9 docs
Since n = 24 is half way from 16 to 32, the number of docs should each machine compute their best results till is:
(7 + 9) / 2= 8 docs