explain hashing a bit more

taivop · Oct 21, 2016 · 48b544b · 48b544b
1 parent f44dba6
commit 48b544b
Show file tree

Hide file tree

Showing 2 changed files with 1 addition and 1 deletion.
diff --git a/report/milestone1.pdf b/report/milestone1.pdf
diff --git a/report/milestone1.tex b/report/milestone1.tex
@@ -102,7 +102,7 @@ \subsection{Load Balancing and Hashing}\label{sec:desc:hashing}
 \item The index of the primary machine is calculated as $i \bmod N$ (adding $N$ if the modulus is negative) where $N$ is the number of servers.
 \end{enumerate}
 
-The uniformity of hashing was validated in tests (see \linktest{UniformHasherTest}). For one million random strings and 13 target machines, the distribution to different machines was the following:
+The uniformity of the key distribution follows from the assumption that input strings are random and the uniformity of \code{String.hashcode()}. This was also validated in tests (see \linktest{UniformHasherTest}): for one million random strings and 13 target machines, the distribution to different machines was the following:
 
 \begin{verbatim}
 Machine   0 got      77229 hits.