Jump to content

Toeplitz Hash Algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Geek3 (talk | contribs) at 13:37, 6 September 2019 (some description and main reference). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
Toeplitz Hash
General
Related toReceive Side Scaling

The Toeplitz Hash Algorithm describes hash functions that compute hash values through matrix multiplication of the key with a suitable Toeplitz matrix.[1] The Toeplitz Hash Algorithm is used in many network interface controllers for receive side scaling.[2][3]

References

  1. ^ Krawczyk, Hugo (1995). "New Hash Functions for Message Authentication". 921: 301–310. doi:10.1007/3-540-49264-X_24. ISSN 0302-9743. {{cite journal}}: Cite journal requires |journal= (help)
  2. ^ "Scaling in the Linux Networking Stack". Archived from the original on 22 May 2014. Retrieved 2014-05-22. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
  3. ^ "Scalable Networking: Eliminating the Receive Processing Bottleneck—Introducing RSS". Archived from the original on 22 May 2014. Retrieved 2014-05-22. {{cite web}}: Unknown parameter |deadurl= ignored (|url-status= suggested) (help)
Stub icon

This computer-programming-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Toeplitz_Hash_Algorithm&oldid=914301397"