ed/TimothyLottes.github.io
1
0
Fork 0
mirror of https://github.com/gomson/TimothyLottes.github.io.git synced 2026-08-04 14:48:49 +00:00
Code Issues Packages Projects Releases Wiki Activity

Add files via upload

Browse Source
This commit is contained in:
TimothyLottes
2016-11-10 11:14:09 -05:00
committed by GitHub
parent 31197f3254
commit d1e6f34eee
2 changed files with 11 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
20130707.html
+10
View File
@@ -0,0 +1,10 @@
<html><head><link rel="stylesheet" href="style.css"></head><body><div class="page">
<h1>20130707 - Slab Hash</h1>
<br>
<i>Something I decided not to use but wanted to write down for possible future reference. This idea isn't new either...</i> Start with a slab size. Slab being some prime multiple of the size of a cacheline. Prime to increase cacheline set aliasing when cachelines of slabs are not always fully used. Take a large chunk of memory which has N slabs. Treat this memory as a hash table with something like <a href="http://code.google.com/p/smhasher/wiki/MurmurHash3">MurmurHash3</a> as a hash function. Instead of traditional {key, pointerToData} which usually implies usually 2 cache misses even with no key collisions, store {key, data} in the slab (avoids a second cache miss).
</div></body></html>
index.html
+1
View File
@@ -109,6 +109,7 @@ Below this is active random migration (416 prior posts still to filter through)
<a href="20131126.html">20131126 - Random Next Generation Notes</a><br>
<a href="20130825.html">20130825 - Modern Memory Mapping</a><br>
<a href="20130808.html">20130808 - Runtime Recompile Reloaded</a><br>
<a href="20130707.html">20130707 - Slab Hash</a><br>
<a href="20130325.html">20130325 - Understanding WIN32 GetRawInputBuffer()</a><br>
<br>
<b>2012</b><br>