This could be quite interesting for me.

I work on massive graph analysis. We assume the graph is in memory (for multiple reasons, and it's appropriate for our target) and ideally in the multi-TiB size. Many of our graph analysis kernels skip around the graph in an unpredictable manner and run for hours. Assuming that pages are allocated per socket on ye typical NUMA machines, the idle page data could give us a general way to measure aggregate load balance for memory operations or help us determine which old graph edges to drop when we need to add newer edges. Sure, we could collect this data ourselves, but it's always nice when someone does it for you...

Thank you for pointing this out!