NovaX

17 ms·

151.
by NovaX 10y ago
There's no either because caches are queues in disguise http://highscalability.com/blog/2016/1/25/design-of-a-modern...
152.
by NovaX 11y ago
This is sometimes referred to as the "admission policy" of a cache and can have a large effect at increasing the hit ratio. Most policies try to minimize the impact of low frequency items. For example SLRU uses a small probation s
153.
On Window TinyLFU(9vx.org)
2 points by NovaX 11y ago|0 comments
154.
by NovaX 11y ago
"Modern CPUs are designed to exploit data-level parallelism via vectorized operations and SIMD instructions. Arrow facilitates such processing." How will Arrow use vectorized instructions on the JVM? That seems to be only availabl
155.
by NovaX 11y ago
TinyLFU+FIFO is in the simulator ( https://github.com/ben-manes/caffeine/wiki/Simulator ). However, you'd probably also want the window cache to correct the deficiency outlined in the updated paper ( http:
156.
by NovaX 11y ago
Any chance you have pointers for public trace files? Its interesting to see the behaviors under different workload patterns. Adding a cost model (GDSF, et al) is too specialized that I haven't spent time looking in that domain. From yo
157.
by NovaX 11y ago
Are you allowed to describe the eviction policy? It would be interesting to know the differences. You can contact me privately (ben.manes at gmail). I'd be interested in knowing, - Did it use a sketch in a similar manner? - Was it an L
158.
by NovaX 11y ago
I recently did an analysis of caching algorithms and the difference can be quite large. Approaches that only use the current working set are very similar, but those that take advantage of historic data can make more intelligent choices. ht
159.
by NovaX 11y ago
As you said elsewhere, the network I/O is the primary bottleneck. There are a lot of different hashtable designs (so per-key locks not required), but fine grained locking of the table/LRU is probably enough. Since an in-app cache
160.
by NovaX 11y ago
The locks are becoming more fine-grained in memcached [1], so that should be less of a problem now. It is possible to remove lock contention on the read path [2] if a concurrent hash table is used. This can be done while using an O(1) evict
161.
by NovaX 11y ago
I've been doing a lot of work on a new optimal eviction policy. It out performs or matches the current gold standard, without requiring the cache holds evicted keys as those policies do (doubles or triples the physical size). Instead i
162.
by NovaX 12y ago
"As a child I received instruction both in the Bible and in the Talmud. I am a Jew"
163.
by NovaX 12y ago
* Benchmarks: https://github.com/ben-manes/caffeine/wiki/Benchmarks * Design: https://github.com/ben-manes/caffeine/wiki/Design This is an evolution of two previously successfu
164.
Caffeine – Java 8 caching(github.com)
3 points by NovaX 12y ago|1 comments
165.
by NovaX 12y ago
That would require a write rate very atypical for a cache and easily mitigated, though largely an almost impossible scenario.
166.
by NovaX 12y ago
Elimination can be enhanced by using a combination strategy, such as DECS [1]. Using a combiner approach should also work on a queue structure, though interestingly enough there is a paper on elimination-based fifo queues. I wrote an elimin
167.
by NovaX 14y ago
Its called a direct mapped cache: http://en.wikipedia.org/wiki/CPU_cache#Direct-mapped_cache