Hi there.
Quick question - I was looking at the code to understand the CRUSH
placement based on unique bijection based on the prime number
generation - I looked at the code and could not locate the specific
code where we generate p > m as described in the papers.
bucket_perm_choose seems to be use "jenkins" hash function to choose a
permutation that is different from the paper ? Would the code still
generate a unique bijection from set {1....m} -> some permutation of
the same set to garauntee that the replica is not placed on the same
sub-cluster devices
Am I missing something here? Kindly help me understand.
Regards
Harmeek
--
To unsubscribe from this list: send the line "unsubscribe ceph-devel" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at http://vger.kernel.org/majordomo-info.html
