During the weekly technical forum within the NetApp ATG group, a team member presented the trip report for
OSDI ‘14 this year. In his talk, he mentioned a paper that pushed me to think more in this line. The paper
is about how to estimate the working set of a workload, using less memory and runs much faster.
The only related work that dealt with the same problem was proposed more than 10 years ago and in that
work, the authors tried to get the exact working set size, with a very high demand for memory
and runtime. So, in their work, they tried to estimate it, with a goal to reduce memory demand and runtime.
They got very impressive results. Together with other papers, I suddenly realized that it is actually
quite common in compute science community, to take this approach: when it is too expensive to
get the accurate result, it is usually a good time to think about how to approximate it with much lower overhead.