libCacheSim
libCacheSim copied to clipboard
1a1a11a
a high performance library for building cache simulators
The current implementation of Belady's algorithm requires an `oracleGeneral` trace format, which has future access information. This design was chosen to reduce the memory requirement because we need to allocate...
i have one question，that is，when i find the data structure of vscsi and print the trace(length and offset), typedef struct { uint32_t sn; uint32_t len; uint32_t nSG; uint16_t cmd; uint16_t...
Hi folks, I am using the trace analyzer for reuse distance on a 371MB trace. The analyzer keeps running, but can never finish, because it runs out of disk space....
example command ``` ./bin/cachesim ../_build/data.csv csv lfuda 0.8,0.9 -t "time-col=1,obj-id-col=3,obj-size-col=4,delimiter=,,obj-id-is-num=0" ``` example data ``` # timestamp (ms), op type [Put:0, Get:1, Delete:2, Head: 3, Copy: 4], object id, object size...
We would like to support dynamic window size in TinyLFU based on descriptions from https://dl.acm.org/doi/10.1145/3274808.3274816?cid=99659224047
We need a new module and binary for implementing algorithms that can generate miss ratio curves.
https://www.usenix.org/conference/fast15/technical-sessions/presentation/waldspurger