5 ms·
Mike Pall (LuaJIT author, maintainer) makes the point that the case presented isn't close to real applications: http://www.freelists.org/post/luajit/LuaJIT-benc
by hwh 13y ago
Mike Pall (LuaJIT author, maintainer) makes the point that the case presented isn't close to real applications: http://www.freelists.org/post/luajit/LuaJIT-benchmark,6 http://www.freelists.org/post/luajit/LuaJIT-benchmark,6
And first and foremost, according to Pall, "it's just measuring the overhead of branch mispredictions and cache misses for an atypical use case of hash tables."
- arh68 13y agoIf I could rerun this afternoon, what test case should I use? What is a good hash test? Mike says [Typical hash table accesses use a) string keys with b) a high temporal correlation and c) they usually have a high hit-rate or a high miss-rate, but it's rarely 50/50.] Surely there is a simple, simple routine that does all this. I want to see this benchmark done right. If it's so simple, why hasn't anyone written it down? The author updated: If have some extra time I'll test some variables later on I will test different hit rates and key types. If you have a reference to a source where statistics around hash table use cases is investigated I'll use that as a basis.