Toeplitz Hash Algorithm
≈ 2 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
The Toeplitz Hash Algorithm describes hash functions that compute hash values through matrix multiplication of the key with a suitable Toeplitz matrix. The Toeplitz Hash Algorithm is used in many network interface controllers for receive side scaling. As an example, with the Toeplitz matrix T the key k results in a hash h as follows: : h = T\cdot k = \begin{pmatrix}1 & 1 & 0 & 1 \\0 & 1 & 1 & 0 \\1 & 0 & 1 & 1 \\\end{pmatrix} \cdot \begin{pmatrix}1\\1\\0\\0\\\end{pmatrix} = \begin{pmatrix}0 \\1 \\1 \\\end{pmatrix} where the entries are bits and all operations are modulo 2. In implementations the highly redundant matrix is not necessarily explicitly stored.
The Toeplitz Hash Algorithm describes hash functions that compute hash values through matrix multiplication of the key with a suitable Toeplitz matrix. The Toeplitz Hash Algorithm is used in many network interface controllers for receive side scaling. As an example, with the Toeplitz matrix T the key k results in a hash h as follows: h = T\cdot k = \begin{pmatrix}1 & 1 & 0 & 1 \\0 & 1 & 1 & 0 \\1 & 0 & 1 & 1 \\\end{pmatrix} \cdot \begin{pmatrix}1\\1\\0\\0\\\end{pmatrix} = \begin{pmatrix}0 \\1 \\1 \\\end{pmatrix} where the entries are bits and all operations are modulo 2. In implementations the highly redundant matrix is not necessarily explicitly stored.
References
Text derived from https://en.wikipedia.org/w/index.php?oldid=1289814034 under CC BY-SA 4.0; modifications have been made.