[RFC PLAN] Some humble ideas for DAMON future works

[RFC PLAN] Some humble ideas for DAMON future works

[SeongJae Park]

Hello,


After the DAMON code is merged (kudos to the community for the great helps), a
few people asked me about my plan for DAMON future works, and if DAMON will be
somewhat usable for their use cases.  I indeed have some humble plans, though
those are only in rough brainsorming level at the moment. so I'd like to share
those here before going forward and start coding, so that I can get some
feedback to fail fast.

User-space Policy or In-kernel Policy?  Both.
=============================================

When discussing about a sort of kernel involved system efficiency
optimizations, I show two kinds of people who have slightly different opinions.
The first party prefer to implement only simple but efficient mechanisms in the
kernel and export it to user space, so that users can make smart user space
policy.  Meanwhile, the second party prefer the kernel just works.  I agree
with both parties.

I think the first opinion makes sense as there are some valuable information
that only user space can know.  I think only such approaches could achieve the
ultimate efficiency in such cases.
I also agree to the second party, though, because there could be some people
who don't have special information that only their applications know, or
resources to do the additional work.  In-kernel simple policies will be still
beneficial for some users even though those are sub-optimal compared to the
highly tuned user space policy, if it provides some extent of efficiency gain
and no regressions for most cases.

I'd like to help both.  For the reason, I made DAMON as an in-kernel mechanism
for both user and kernel-space policies.  It provides highly tunable general
user space interface to help the first party.  It also provides in-kernel
policies which built on top of DAMON using its kernel-space API for specific
common use cases with conservative default parameters that assumed to incur no
regression but some extent of benefits in most cases, namely DAMON-based
proactive reclamation.  I will continue pursuing the two ways.

Imaginable DAMON-based Policies
===============================

I'd like to start from listing some imaginable data access-aware operation
policies that I hope to eventually be made.  The list will hopefully shed light
on how DAMON should be evolved to efficiently support the policies.

DAMON-based Proactive LRU-pages (de)Activation
----------------------------------------------

The reclamation mechanism which selects reclaim target using the
active/inactive LRU lists sometimes doesn't work well.  According to my
previous work, providing access pattern-based hints can significantly improve
the performance under memory pressure[1,2].

Proactive reclamation is known to be useful for many memory intensive systems,
and now we have a DAMON-based implementation of it[3].  However, the proactive
reclamation wouldn't be so welcome to some systems having high cost of I/O.
Also, even though the system runs proactive reclamation, memory pressure can
still occasionally triggered.

My idea for helping this situation is manipulating the orders of pages in LRU
lists using DAMON-provided monitoring results.  That is, making DAMON
proactively finds hot/cold memory regions and moves pages of the hot regions to
the head of the active list, while moving pages of the cold regions to the tail
of the inactive list.  This will help eventual reclamation under memory
pressure to evict cold pages first, so incur less additional page faults.

[1] https://www.usenix.org/conference/hotstorage19/presentation/park
[2] https://linuxplumbersconf.org/event/4/contributions/548/
[3] https://docs.kernel.org/admin-guide/mm/damon/reclaim.html

DAMON-based THP Coalesce/Split
------------------------------

THP is know to significantly improve performance, but also increase memory
footprint[1].  We can minimize the memory overhead while preserving the
performance benefit by asking DAMON to provide MADV_HUGEPAGE-like hints for hot
memory regions of >= 2MiB size, and MADV_NOHUGEPAGE-like hints for cold memory
regions.  Our experimental user space policy implementation[2] of this idea
removes 76.15% of THP memory waste while preserving 51.25% of THP speedup in
total.

[1] https://www.usenix.org/conference/osdi16/technical-sessions/presentation/kwon
[2] https://damonitor.github.io/doc/html/v34/vm/damon/eval.html

DAMON-based Tiered Memory (Pro|De)motion
----------------------------------------

In tiered memory systems utilizing DRAM and PMEM[1], we can promote hot pages to
DRAM and demote cold pages to PMEM using DAMON.  A patch for allowing
access-aware demotion user space policy development is already submitted[2] by
Baolin.

[1] https://www.intel.com/content/www/us/en/products/details/memory-storage/optane-memory.html
[2] https://lore.kernel.org/linux-mm/cover.1640171137.git.baolin.wang@linux.alibaba.com/

DAMON-based Proactive Compaction
--------------------------------

Compaction uses migration scanner to find migration source pages.  Hot pages
would be more likely to be unmovable compared to cold pages, so it would be
better to try migration of cold pages first.  DAMON could be used here.  That
is, proactively monitoring accesses via DAMON and start compaction so that the
migration scanner scan cold memory ranges first.  I should admit I'm not
familiar with compaction code and I have no PoC data for this but just the
groundless idea, though.

How We Can Implement These
--------------------------

Implementing most of the above mentioned policies wouldn't be too difficult
because we have DAMON-based Operation Schemes (DAMOS).  That is, we will need
to implement some more DAMOS action for each policy.  Some existing kernel
functions can be reused.  Such actions would include LRU (de)activation, THP
coalesce/split hints, memory (pro|de)motion, and cold pages first scanning
compaction.  Then, supporting those actions with the user space interface will
allows implementing user space policies.  If we find reasonably good default
DAMOS parameters and some kernel side control mechanism, we can further make
those as kernel policies in form of, say, builtin modules.

How DAMON Should Be Evolved For Supporting Those
================================================

Let's discuss what kind of changes in DAMON will be needed to efficiently
support above mentioned policies.

Simultaneously Monitoring Different Types of Address Spaces
-----------------------------------------------------------

It would be better to run all the above mentioned policies simultaneously on
single system.  As some policies such as LRU-pages (de)activation would better
to run on physical address space while some policies such as THP coalesce/split
would need to run on virtual address spaces, DAMON should support concurrently
monitoring different address spaces.  We can always do this by creating one
DAMON context for each address space and running those.  However, as the
address spaces will conflict, each other will be interfered.  Current idea for
avoiding this is allowing multiple DAMON contexts to run on a single thread,
forcing them to have same monitoring contexts.

Online Parameters Updates
-------------------------

Someone would also want to dynamically turn on/off and/or tune each policy.
This is impossible with current DAMON, because it prohibits updating any
parameter while it is running.  We disallow the online parameters update
mainly because we want to avoid doing additional synchronization between the
running kdamond and the parameters updater.  The idea for supporting the use
case while avoiding the additional synchronization is, allowing users to pause
DAMON and update parameters while it is paused.

A Better DAMON interface
------------------------

DAMON is currently exposing its major functionality to the user space via the
debugfs.  After all, DAMON is not for only debugging.  Also, this makes the
interface depends on debugfs unnecessarily, and considered unreliable.  Also,
the interface is quite unflexible for future interface extension.  I admit it
was not a good choice.

It would be better to implement another reliable and easily extensible
interface, and deprecate the debugfs interface.  The idea is exposing the
interface via sysfs using hierarchical Kobjects under mm_kobject.  For example,
the usage would be something like below:

    # cd /sys/kernel/mm/damon
    # echo 1 > nr_kdamonds
    # echo 1 > kdamond_1/contexts/nr_contexts
    # echo va > kdamond_1/contexts/context_1/target_type
    # echo 1 > kdamond_1/contexts/context_1/targets/nr_targets
    # echo $(pidof <workload>) > \
                    kdamond_1/contexts/context_1/targets/target_1/pid
    # echo Y > monitor_on

The underlying files hierarchy could be something like below.

    /sys/kernel/mm/damon/
    │ monitor_on
    │ kdamonds
    │ │ nr_kdamonds
    │ │ kdamond_1/
    │ │ │ kdamond_pid
    │ │ │ contexts
    │ │ │ │ nr_contexts
    │ │ │ │ context_1/
    │ │ │ │ │ target_type (va | pa)
    │ │ │ │ │ attrs/
    │ │ │ │ │ │ intervals/sampling,aggr,update
    │ │ │ │ │ │ nr_regions/min,max
    │ │ │ │ │ targets/
    │ │ │ │ │ │ nr_targets
    │ │ │ │ │ │ target_1/
    │ │ │ │ │ │ │ pid
    │ │ │ │ │ │ │ init_regions/
    │ │ │ │ │ │ │ │ region1/
    │ │ │ │ │ │ │ │ │ start,end
    │ │ │ │ │ │ │ │ ...
    │ │ │ │ │ │ ...
    │ │ │ │ │ schemes/
    │ │ │ │ │ │ nr_schemes
    │ │ │ │ │ │ scheme_1/
    │ │ │ │ │ │ │ action
    │ │ │ │ │ │ │ target_access_pattern/
    │ │ │ │ │ │ │ │ sz/min,max
    │ │ │ │ │ │ │ │ nr_accesses/min,max
    │ │ │ │ │ │ │ │ age/min,max
    │ │ │ │ │ │ │ quotas/
    │ │ │ │ │ │ │ │ ms,bytes,reset_interval
    │ │ │ │ │ │ │ │ prioritization_weights/
    │ │ │ │ │ │ │ │   sz,nr_accesses,age
    │ │ │ │ │ │ │ watermarks/
    │ │ │ │ │ │ │   metric,check_interval,high,mid,low
    │ │ │ │ │ │ │ stats/
    │ │ │ │ │ │ │ │ quota_exceeds
    │ │ │ │ │ │ │ │ tried/nr,sz
    │ │ │ │ │ │ │ │ applied/nr,sz
    │ │ │ │ │ │ │ ...
    │ │ │ │ ...
    │ │ ...

More DAMON Future Works
=======================

In addition to above mentioned things, there are many works to do.  It would be
better to extend DAMON for more use cases and address spaces support, including
page granularity, idleness only, read/write only, page cache only, and cgroups
monitoring supports.

Also it would be valuable to improve the accuracy of monitoring, using some
adaptive monitoring attributes tuning or some new fancy idea[1].

DAMOS could also be improved by utilizing its own autotuning feature, for
example, by monitoring PSI and other metrics related to the given action.

[1] https://linuxplumbersconf.org/event/11/contributions/984/


Thank you For Reading This
==========================

So, I shared current rough and immature plans off the top of my head here.
Hope this helps you understanding what I'm thinking about for the future of
DAMON.  Please note again that those are only in brainstorming level and some
are only groundless idea.  Some might be just insane ideas.  Hence, everything
is open for change or failure.  If you have any comment, please feel free to
let me know.


Thanks,
SJ

[RFC PLAN] Some humble ideas for DAMON future works

[SeongJae Park]

Hello,


After the DAMON code is merged (kudos to the community for the great helps), a
few people asked me about my plan for DAMON future works, and if DAMON will be
somewhat usable for their use cases.  I indeed have some humble plans, though
those are only in rough brainsorming level at the moment. so I'd like to share
those here before going forward and start coding, so that I can get some
feedback to fail fast.

User-space Policy or In-kernel Policy?  Both.
=============================================

When discussing about a sort of kernel involved system efficiency
optimizations, I show two kinds of people who have slightly different opinions.
The first party prefer to implement only simple but efficient mechanisms in the
kernel and export it to user space, so that users can make smart user space
policy.  Meanwhile, the second party prefer the kernel just works.  I agree
with both parties.

I think the first opinion makes sense as there are some valuable information
that only user space can know.  I think only such approaches could achieve the
ultimate efficiency in such cases.
I also agree to the second party, though, because there could be some people
who don't have special information that only their applications know, or
resources to do the additional work.  In-kernel simple policies will be still
beneficial for some users even though those are sub-optimal compared to the
highly tuned user space policy, if it provides some extent of efficiency gain
and no regressions for most cases.

I'd like to help both.  For the reason, I made DAMON as an in-kernel mechanism
for both user and kernel-space policies.  It provides highly tunable general
user space interface to help the first party.  It also provides in-kernel
policies which built on top of DAMON using its kernel-space API for specific
common use cases with conservative default parameters that assumed to incur no
regression but some extent of benefits in most cases, namely DAMON-based
proactive reclamation.  I will continue pursuing the two ways.

Imaginable DAMON-based Policies
===============================

I'd like to start from listing some imaginable data access-aware operation
policies that I hope to eventually be made.  The list will hopefully shed light
on how DAMON should be evolved to efficiently support the policies.

DAMON-based Proactive LRU-pages (de)Activation
----------------------------------------------

The reclamation mechanism which selects reclaim target using the
active/inactive LRU lists sometimes doesn't work well.  According to my
previous work, providing access pattern-based hints can significantly improve
the performance under memory pressure[1,2].

Proactive reclamation is known to be useful for many memory intensive systems,
and now we have a DAMON-based implementation of it[3].  However, the proactive
reclamation wouldn't be so welcome to some systems having high cost of I/O.
Also, even though the system runs proactive reclamation, memory pressure can
still occasionally triggered.

My idea for helping this situation is manipulating the orders of pages in LRU
lists using DAMON-provided monitoring results.  That is, making DAMON
proactively finds hot/cold memory regions and moves pages of the hot regions to
the head of the active list, while moving pages of the cold regions to the tail
of the inactive list.  This will help eventual reclamation under memory
pressure to evict cold pages first, so incur less additional page faults.

[1] https://www.usenix.org/conference/hotstorage19/presentation/park
[2] https://linuxplumbersconf.org/event/4/contributions/548/
[3] https://docs.kernel.org/admin-guide/mm/damon/reclaim.html

DAMON-based THP Coalesce/Split
------------------------------

THP is know to significantly improve performance, but also increase memory
footprint[1].  We can minimize the memory overhead while preserving the
performance benefit by asking DAMON to provide MADV_HUGEPAGE-like hints for hot
memory regions of >= 2MiB size, and MADV_NOHUGEPAGE-like hints for cold memory
regions.  Our experimental user space policy implementation[2] of this idea
removes 76.15% of THP memory waste while preserving 51.25% of THP speedup in
total.

[1] https://www.usenix.org/conference/osdi16/technical-sessions/presentation/kwon
[2] https://damonitor.github.io/doc/html/v34/vm/damon/eval.html

DAMON-based Tiered Memory (Pro|De)motion
----------------------------------------

In tiered memory systems utilizing DRAM and PMEM[1], we can promote hot pages to
DRAM and demote cold pages to PMEM using DAMON.  A patch for allowing
access-aware demotion user space policy development is already submitted[2] by
Baolin.

[1] https://www.intel.com/content/www/us/en/products/details/memory-storage/optane-memory.html
[2] https://lore.kernel.org/linux-mm/cover.1640171137.git.baolin.wang@linux.alibaba.com/

DAMON-based Proactive Compaction
--------------------------------

Compaction uses migration scanner to find migration source pages.  Hot pages
would be more likely to be unmovable compared to cold pages, so it would be
better to try migration of cold pages first.  DAMON could be used here.  That
is, proactively monitoring accesses via DAMON and start compaction so that the
migration scanner scan cold memory ranges first.  I should admit I'm not
familiar with compaction code and I have no PoC data for this but just the
groundless idea, though.

How We Can Implement These
--------------------------

Implementing most of the above mentioned policies wouldn't be too difficult
because we have DAMON-based Operation Schemes (DAMOS).  That is, we will need
to implement some more DAMOS action for each policy.  Some existing kernel
functions can be reused.  Such actions would include LRU (de)activation, THP
coalesce/split hints, memory (pro|de)motion, and cold pages first scanning
compaction.  Then, supporting those actions with the user space interface will
allows implementing user space policies.  If we find reasonably good default
DAMOS parameters and some kernel side control mechanism, we can further make
those as kernel policies in form of, say, builtin modules.

How DAMON Should Be Evolved For Supporting Those
================================================

Let's discuss what kind of changes in DAMON will be needed to efficiently
support above mentioned policies.

Simultaneously Monitoring Different Types of Address Spaces
-----------------------------------------------------------

It would be better to run all the above mentioned policies simultaneously on
single system.  As some policies such as LRU-pages (de)activation would better
to run on physical address space while some policies such as THP coalesce/split
would need to run on virtual address spaces, DAMON should support concurrently
monitoring different address spaces.  We can always do this by creating one
DAMON context for each address space and running those.  However, as the
address spaces will conflict, each other will be interfered.  Current idea for
avoiding this is allowing multiple DAMON contexts to run on a single thread,
forcing them to have same monitoring contexts.

Online Parameters Updates
-------------------------

Someone would also want to dynamically turn on/off and/or tune each policy.
This is impossible with current DAMON, because it prohibits updating any
parameter while it is running.  We disallow the online parameters update
mainly because we want to avoid doing additional synchronization between the
running kdamond and the parameters updater.  The idea for supporting the use
case while avoiding the additional synchronization is, allowing users to pause
DAMON and update parameters while it is paused.

A Better DAMON interface
------------------------

DAMON is currently exposing its major functionality to the user space via the
debugfs.  After all, DAMON is not for only debugging.  Also, this makes the
interface depends on debugfs unnecessarily, and considered unreliable.  Also,
the interface is quite unflexible for future interface extension.  I admit it
was not a good choice.

It would be better to implement another reliable and easily extensible
interface, and deprecate the debugfs interface.  The idea is exposing the
interface via sysfs using hierarchical Kobjects under mm_kobject.  For example,
the usage would be something like below:

    # cd /sys/kernel/mm/damon
    # echo 1 > nr_kdamonds
    # echo 1 > kdamond_1/contexts/nr_contexts
    # echo va > kdamond_1/contexts/context_1/target_type
    # echo 1 > kdamond_1/contexts/context_1/targets/nr_targets
    # echo $(pidof <workload>) > \
                    kdamond_1/contexts/context_1/targets/target_1/pid
    # echo Y > monitor_on

The underlying files hierarchy could be something like below.

    /sys/kernel/mm/damon/
    │ monitor_on
    │ kdamonds
    │ │ nr_kdamonds
    │ │ kdamond_1/
    │ │ │ kdamond_pid
    │ │ │ contexts
    │ │ │ │ nr_contexts
    │ │ │ │ context_1/
    │ │ │ │ │ target_type (va | pa)
    │ │ │ │ │ attrs/
    │ │ │ │ │ │ intervals/sampling,aggr,update
    │ │ │ │ │ │ nr_regions/min,max
    │ │ │ │ │ targets/
    │ │ │ │ │ │ nr_targets
    │ │ │ │ │ │ target_1/
    │ │ │ │ │ │ │ pid
    │ │ │ │ │ │ │ init_regions/
    │ │ │ │ │ │ │ │ region1/
    │ │ │ │ │ │ │ │ │ start,end
    │ │ │ │ │ │ │ │ ...
    │ │ │ │ │ │ ...
    │ │ │ │ │ schemes/
    │ │ │ │ │ │ nr_schemes
    │ │ │ │ │ │ scheme_1/
    │ │ │ │ │ │ │ action
    │ │ │ │ │ │ │ target_access_pattern/
    │ │ │ │ │ │ │ │ sz/min,max
    │ │ │ │ │ │ │ │ nr_accesses/min,max
    │ │ │ │ │ │ │ │ age/min,max
    │ │ │ │ │ │ │ quotas/
    │ │ │ │ │ │ │ │ ms,bytes,reset_interval
    │ │ │ │ │ │ │ │ prioritization_weights/
    │ │ │ │ │ │ │ │   sz,nr_accesses,age
    │ │ │ │ │ │ │ watermarks/
    │ │ │ │ │ │ │   metric,check_interval,high,mid,low
    │ │ │ │ │ │ │ stats/
    │ │ │ │ │ │ │ │ quota_exceeds
    │ │ │ │ │ │ │ │ tried/nr,sz
    │ │ │ │ │ │ │ │ applied/nr,sz
    │ │ │ │ │ │ │ ...
    │ │ │ │ ...
    │ │ ...

More DAMON Future Works
=======================

In addition to above mentioned things, there are many works to do.  It would be
better to extend DAMON for more use cases and address spaces support, including
page granularity, idleness only, read/write only, page cache only, and cgroups
monitoring supports.

Also it would be valuable to improve the accuracy of monitoring, using some
adaptive monitoring attributes tuning or some new fancy idea[1].

DAMOS could also be improved by utilizing its own autotuning feature, for
example, by monitoring PSI and other metrics related to the given action.

[1] https://linuxplumbersconf.org/event/11/contributions/984/


Thank you For Reading This
==========================

So, I shared current rough and immature plans off the top of my head here.
Hope this helps you understanding what I'm thinking about for the future of
DAMON.  Please note again that those are only in brainstorming level and some
are only groundless idea.  Some might be just insane ideas.  Hence, everything
is open for change or failure.  If you have any comment, please feel free to
let me know.


Thanks,
SJ

Re: [RFC PLAN] Some humble ideas for DAMON future works

[David Rientjes]

[-- Attachment #1: Type: text/plain, Size: 17827 bytes --]

On Wed, 19 Jan 2022, SeongJae Park wrote:

> User-space Policy or In-kernel Policy?  Both.
> =============================================
> 
> When discussing about a sort of kernel involved system efficiency
> optimizations, I show two kinds of people who have slightly different opinions.
> The first party prefer to implement only simple but efficient mechanisms in the
> kernel and export it to user space, so that users can make smart user space
> policy.  Meanwhile, the second party prefer the kernel just works.  I agree
> with both parties.
> 

Thanks for starting this discussion, SeongJae, and kicking it off with all 
of your roadmap thoughts.  It's very helpful.

I would love for this to turn into an active discussion amongst those 
people who are currently looking into using DAMON for their set of 
interests and also those who are investigating how its current set of 
support can be adapated for their use cases.

For discussion on where the kernel and userspace boundary lies for policy 
decisions, I think it depends heavily on (1) the specific subcomponent of 
the mm subsystem being discussed, I don't think this boundary will be the 
same for all areas (and can/will evolve over time), and (2) the difference  
between the base out-of-the-box behavior that Linux provides for everybody 
and the elaborate support that some users need for efficiency or 
performance.  This is going to be very different for things like hugepage 
optimizations and memory compaction, for example.

> I think the first opinion makes sense as there are some valuable information
> that only user space can know.  I think only such approaches could achieve the
> ultimate efficiency in such cases.
> I also agree to the second party, though, because there could be some people
> who don't have special information that only their applications know, or
> resources to do the additional work.  In-kernel simple policies will be still
> beneficial for some users even though those are sub-optimal compared to the
> highly tuned user space policy, if it provides some extent of efficiency gain
> and no regressions for most cases.
> 
> I'd like to help both.  For the reason, I made DAMON as an in-kernel mechanism
> for both user and kernel-space policies.  It provides highly tunable general
> user space interface to help the first party.  It also provides in-kernel
> policies which built on top of DAMON using its kernel-space API for specific
> common use cases with conservative default parameters that assumed to incur no
> regression but some extent of benefits in most cases, namely DAMON-based
> proactive reclamation.  I will continue pursuing the two ways.
> 

Are you referring only to root userspace here or are you including 
non-root userspace?

Imagine a process that is willing to accept the cpu overhead for doing thp 
collapse for portions of its memory in process context rather than waiting 
for khugepaged and that we had a mechanism (discussed later) for doing 
that in the kernel.  The non-root user in this case would need the ability 
to monitor regions of its own heap, for example, and disregard others.  
The malloc implementation wants to answer the question of "what regions of 
my heap are accessed very frequently?" so that we can do hugepage 
optimizations.

Do you see that the user will have the ability to fork off a DAMON context 
to do this monitoring for their own heap?  kdamond could be attached to a 
cpu cgroup to charge the cpu overhead for doing this monitoring and the 
time spent applying any actions to that memory to that workload on a 
multi-tenant machine.

I think it would be useful to discuss the role of non-root userspace for 
future DAMON support.

> Imaginable DAMON-based Policies
> ===============================
> 
> I'd like to start from listing some imaginable data access-aware operation
> policies that I hope to eventually be made.  The list will hopefully shed light
> on how DAMON should be evolved to efficiently support the policies.
> 
> DAMON-based Proactive LRU-pages (de)Activation
> ----------------------------------------------
> 
> The reclamation mechanism which selects reclaim target using the
> active/inactive LRU lists sometimes doesn't work well.  According to my
> previous work, providing access pattern-based hints can significantly improve
> the performance under memory pressure[1,2].
> 
> Proactive reclamation is known to be useful for many memory intensive systems,
> and now we have a DAMON-based implementation of it[3].  However, the proactive
> reclamation wouldn't be so welcome to some systems having high cost of I/O.
> Also, even though the system runs proactive reclamation, memory pressure can
> still occasionally triggered.
> 
> My idea for helping this situation is manipulating the orders of pages in LRU
> lists using DAMON-provided monitoring results.  That is, making DAMON
> proactively finds hot/cold memory regions and moves pages of the hot regions to
> the head of the active list, while moving pages of the cold regions to the tail
> of the inactive list.  This will help eventual reclamation under memory
> pressure to evict cold pages first, so incur less additional page faults.
> 

Let's add Johannes Weiner <hannes@cmpxchg.org> into this discussion as 
well since we had previously discussed persistent background ordering of 
the lru lists based on hotness and coldness of memory before.  This 
discussion had happened before DAMON was merged upstream, so that DAMON 
has landed it is likely an area that he's interested in.

One gotcha with the above might be the handling of MADV_FREE memory that 
we want to lazily free under memory pressure.  Userspace has indicated 
that we can free this memory whenever necessary, so the kernel 
implementation moves this memory to the inactive lru regardless of any 
hotness or coldness of the memory.  In other words, this memory *can* have 
very high access frequencies in the short-term and then it's madvised with 
MADV_FREE by userspace to free if we encounter memory pressure.  It seems 
like this needs to override the DAMON-provided monitoring results since 
userspace just knows better in certain scenarios.

> [1] https://www.usenix.org/conference/hotstorage19/presentation/park
> [2] https://linuxplumbersconf.org/event/4/contributions/548/
> [3] https://docs.kernel.org/admin-guide/mm/damon/reclaim.html
> 
> DAMON-based THP Coalesce/Split
> ------------------------------
> 
> THP is know to significantly improve performance, but also increase memory
> footprint[1].  We can minimize the memory overhead while preserving the
> performance benefit by asking DAMON to provide MADV_HUGEPAGE-like hints for hot
> memory regions of >= 2MiB size, and MADV_NOHUGEPAGE-like hints for cold memory
> regions.  Our experimental user space policy implementation[2] of this idea
> removes 76.15% of THP memory waste while preserving 51.25% of THP speedup in
> total.
> 

This is a very interesting area to explore, and turns out to be very 
timely as well.  We'll soon be proposing the MADV_COLLAPSE support that we 
discussed here[1] and was well received.

One thought here is that with DAMON we can create a scheme to apply a 
DAMOS_COLLAPSE action on very hot memory in the monitoring region that 
would simply call into the new MADV_COLLAPSE code to allow us to do a 
synchronous collapse in process context.  With the current DAMON support, 
this seems very straight-forward once we have MADV_COLLAPSE.

[1] https://lore.kernel.org/all/d098c392-273a-36a4-1a29-59731cdf5d3d@google.com/

> [1] https://www.usenix.org/conference/osdi16/technical-sessions/presentation/kwon
> [2] https://damonitor.github.io/doc/html/v34/vm/damon/eval.html
> 
> DAMON-based Tiered Memory (Pro|De)motion
> ----------------------------------------
> 
> In tiered memory systems utilizing DRAM and PMEM[1], we can promote hot pages to
> DRAM and demote cold pages to PMEM using DAMON.  A patch for allowing
> access-aware demotion user space policy development is already submitted[2] by
> Baolin.
> 

Thanks for this, it's very useful.  Is it possible to point to any data on 
how responsive the promotion side can be to recent memory accesses?  It 
seems like we'll need to promote that memory quite quickly to not suffer 
long-lived performance degradations if we're treating DRAM and PMEM as 
schedulable memory.

DAMON provides us with a framework so that we have complete control over 
the efficiency of scanning PMEM for possible promotion candidates.  But 
I'd be very interested in seeing any data from Baolin (or anybody else) on 
just how responsive the promotion side can be.

> [1] https://www.intel.com/content/www/us/en/products/details/memory-storage/optane-memory.html
> [2] https://lore.kernel.org/linux-mm/cover.1640171137.git.baolin.wang@linux.alibaba.com/
> 
> DAMON-based Proactive Compaction
> --------------------------------
> 
> Compaction uses migration scanner to find migration source pages.  Hot pages
> would be more likely to be unmovable compared to cold pages, so it would be
> better to try migration of cold pages first.  DAMON could be used here.  That
> is, proactively monitoring accesses via DAMON and start compaction so that the
> migration scanner scan cold memory ranges first.  I should admit I'm not
> familiar with compaction code and I have no PoC data for this but just the
> groundless idea, though.
> 

Is compaction enlightenment for DAMON a high priority at this point, or 
would AutoNUMA be a more interesting candidate?

Today, AutoNUMA works with a sliding window setting page tables to have 
PROT_NONE permissions so that we induce a page fault and can determine 
which cpu is accessing potentially remote memory (task_numa_work()).  If 
that's happening, we can migrate the memory to the home NUMA node so that 
we can avoid those remote memory accesses and the increased latency that 
it induces.

Idea: if we enlightened task_numa_work() to prioritize hot memory using 
DAMON, it *seems* like this would be most effective rather than relying on 
a sliding window.  We want to migrate memory that is frequently being 
accessed to reduce the remote memory access latency, we only get a minimal 
improvement (mostly only node balancing) for memory that is rarely 
accessed.

I'm somewhat surprised this isn't one of the highest priorities, actually, 
for being enlightened with DAMON support, so it feels like I'm missing 
something obvious.

Let's also add Dave Hansen <dave.hansen@linux.intel.com> into the thread 
for the above two sections (memory tiering and AutoNUMA) because I know 
he's thought about both.

> How We Can Implement These
> --------------------------
> 
> Implementing most of the above mentioned policies wouldn't be too difficult
> because we have DAMON-based Operation Schemes (DAMOS).  That is, we will need
> to implement some more DAMOS action for each policy.  Some existing kernel
> functions can be reused.  Such actions would include LRU (de)activation, THP
> coalesce/split hints, memory (pro|de)motion, and cold pages first scanning
> compaction.  Then, supporting those actions with the user space interface will
> allows implementing user space policies.  If we find reasonably good default
> DAMOS parameters and some kernel side control mechanism, we can further make
> those as kernel policies in form of, say, builtin modules.
> 
> How DAMON Should Be Evolved For Supporting Those
> ================================================
> 
> Let's discuss what kind of changes in DAMON will be needed to efficiently
> support above mentioned policies.
> 
> Simultaneously Monitoring Different Types of Address Spaces
> -----------------------------------------------------------
> 
> It would be better to run all the above mentioned policies simultaneously on
> single system.  As some policies such as LRU-pages (de)activation would better
> to run on physical address space while some policies such as THP coalesce/split
> would need to run on virtual address spaces, DAMON should support concurrently
> monitoring different address spaces.  We can always do this by creating one
> DAMON context for each address space and running those.  However, as the
> address spaces will conflict, each other will be interfered.  Current idea for
> avoiding this is allowing multiple DAMON contexts to run on a single thread,
> forcing them to have same monitoring contexts.
> 
> Online Parameters Updates
> -------------------------
> 
> Someone would also want to dynamically turn on/off and/or tune each policy.
> This is impossible with current DAMON, because it prohibits updating any
> parameter while it is running.  We disallow the online parameters update
> mainly because we want to avoid doing additional synchronization between the
> running kdamond and the parameters updater.  The idea for supporting the use
> case while avoiding the additional synchronization is, allowing users to pause
> DAMON and update parameters while it is paused.
> 
> A Better DAMON interface
> ------------------------
> 
> DAMON is currently exposing its major functionality to the user space via the
> debugfs.  After all, DAMON is not for only debugging.  Also, this makes the
> interface depends on debugfs unnecessarily, and considered unreliable.  Also,
> the interface is quite unflexible for future interface extension.  I admit it
> was not a good choice.
> 
> It would be better to implement another reliable and easily extensible
> interface, and deprecate the debugfs interface.  The idea is exposing the
> interface via sysfs using hierarchical Kobjects under mm_kobject.  For example,
> the usage would be something like below:
> 
>     # cd /sys/kernel/mm/damon
>     # echo 1 > nr_kdamonds
>     # echo 1 > kdamond_1/contexts/nr_contexts
>     # echo va > kdamond_1/contexts/context_1/target_type
>     # echo 1 > kdamond_1/contexts/context_1/targets/nr_targets
>     # echo $(pidof <workload>) > \
>                     kdamond_1/contexts/context_1/targets/target_1/pid
>     # echo Y > monitor_on
> 
> The underlying files hierarchy could be something like below.
> 
>     /sys/kernel/mm/damon/
>     │ monitor_on
>     │ kdamonds
>     │ │ nr_kdamonds
>     │ │ kdamond_1/
>     │ │ │ kdamond_pid
>     │ │ │ contexts
>     │ │ │ │ nr_contexts
>     │ │ │ │ context_1/
>     │ │ │ │ │ target_type (va | pa)
>     │ │ │ │ │ attrs/
>     │ │ │ │ │ │ intervals/sampling,aggr,update
>     │ │ │ │ │ │ nr_regions/min,max
>     │ │ │ │ │ targets/
>     │ │ │ │ │ │ nr_targets
>     │ │ │ │ │ │ target_1/
>     │ │ │ │ │ │ │ pid
>     │ │ │ │ │ │ │ init_regions/
>     │ │ │ │ │ │ │ │ region1/
>     │ │ │ │ │ │ │ │ │ start,end
>     │ │ │ │ │ │ │ │ ...
>     │ │ │ │ │ │ ...
>     │ │ │ │ │ schemes/
>     │ │ │ │ │ │ nr_schemes
>     │ │ │ │ │ │ scheme_1/
>     │ │ │ │ │ │ │ action
>     │ │ │ │ │ │ │ target_access_pattern/
>     │ │ │ │ │ │ │ │ sz/min,max
>     │ │ │ │ │ │ │ │ nr_accesses/min,max
>     │ │ │ │ │ │ │ │ age/min,max
>     │ │ │ │ │ │ │ quotas/
>     │ │ │ │ │ │ │ │ ms,bytes,reset_interval
>     │ │ │ │ │ │ │ │ prioritization_weights/
>     │ │ │ │ │ │ │ │   sz,nr_accesses,age
>     │ │ │ │ │ │ │ watermarks/
>     │ │ │ │ │ │ │   metric,check_interval,high,mid,low
>     │ │ │ │ │ │ │ stats/
>     │ │ │ │ │ │ │ │ quota_exceeds
>     │ │ │ │ │ │ │ │ tried/nr,sz
>     │ │ │ │ │ │ │ │ applied/nr,sz
>     │ │ │ │ │ │ │ ...
>     │ │ │ │ ...
>     │ │ ...
> 
> More DAMON Future Works
> =======================
> 
> In addition to above mentioned things, there are many works to do.  It would be
> better to extend DAMON for more use cases and address spaces support, including
> page granularity, idleness only, read/write only, page cache only, and cgroups
> monitoring supports.
> 

Cgroup support is very interesting so that we do not need to constantly 
maintain a list of target_ids when a job forks new processes.  We've 
discussed the potential for passing a cgroup inode as the target rather 
than pid for virtual address monitoring that would operate over the set of 
processes attached to that cgroup hierarchy.  Is this what you imagine for 
cgroup support or something more elaborate (or something different 
entirely :)?

> Also it would be valuable to improve the accuracy of monitoring, using some
> adaptive monitoring attributes tuning or some new fancy idea[1].
> 
> DAMOS could also be improved by utilizing its own autotuning feature, for
> example, by monitoring PSI and other metrics related to the given action.
> 
> [1] https://linuxplumbersconf.org/event/11/contributions/984/
> 

I'd like to add another topic here: DAMON based monitoring for virtualized 
workloads.  Today, it seems like you'd need to run DAMON in the guest to 
be able to describe its working set.  Monitoring the hypervisor process 
is inadequate because it will reveal the first access to the guest owned 
memory but not the accesses done by the guest itself.  So it seems like 
the *current* support for virtual address monitoring is insufficient 
unless the guest is enlightened to do DAMON monitoring itself.

What about unenlightened guests?  An idea is a third DAMON monitoring mode 
that monitors accesses in the EPT.  Have you thought about this before or 
other ways to monitor memory access for an *unenlightened* guest?  Would 
love to have a discussion on this.

Re: [RFC PLAN] Some humble ideas for DAMON future works

[SeongJae Park]

Hello David,


Thank you so much for the greatful comments!

On Sun, 23 Jan 2022 14:48:35 -0800 (PST) David Rientjes <rientjes@google.com> wrote:

> On Wed, 19 Jan 2022, SeongJae Park wrote:
> 
> > User-space Policy or In-kernel Policy?  Both.
> > =============================================
> > 
> > When discussing about a sort of kernel involved system efficiency
> > optimizations, I show two kinds of people who have slightly different opinions.
> > The first party prefer to implement only simple but efficient mechanisms in the
> > kernel and export it to user space, so that users can make smart user space
> > policy.  Meanwhile, the second party prefer the kernel just works.  I agree
> > with both parties.
> > 
> 
> Thanks for starting this discussion, SeongJae, and kicking it off with all 
> of your roadmap thoughts.  It's very helpful.
> 
> I would love for this to turn into an active discussion amongst those 
> people who are currently looking into using DAMON for their set of 
> interests and also those who are investigating how its current set of 
> support can be adapated for their use cases.

Glad to hear that and same to me!

> 
> For discussion on where the kernel and userspace boundary lies for policy 
> decisions, I think it depends heavily on (1) the specific subcomponent of 
> the mm subsystem being discussed, I don't think this boundary will be the 
> same for all areas (and can/will evolve over time), and (2) the difference  
> between the base out-of-the-box behavior that Linux provides for everybody 
> and the elaborate support that some users need for efficiency or 
> performance.  This is going to be very different for things like hugepage 
> optimizations and memory compaction, for example.

Agreed.

> 
> > I think the first opinion makes sense as there are some valuable information
> > that only user space can know.  I think only such approaches could achieve the
> > ultimate efficiency in such cases.
> > I also agree to the second party, though, because there could be some people
> > who don't have special information that only their applications know, or
> > resources to do the additional work.  In-kernel simple policies will be still
> > beneficial for some users even though those are sub-optimal compared to the
> > highly tuned user space policy, if it provides some extent of efficiency gain
> > and no regressions for most cases.
> > 
> > I'd like to help both.  For the reason, I made DAMON as an in-kernel mechanism
> > for both user and kernel-space policies.  It provides highly tunable general
> > user space interface to help the first party.  It also provides in-kernel
> > policies which built on top of DAMON using its kernel-space API for specific
> > common use cases with conservative default parameters that assumed to incur no
> > regression but some extent of benefits in most cases, namely DAMON-based
> > proactive reclamation.  I will continue pursuing the two ways.
> > 
> 
> Are you referring only to root userspace here or are you including 
> non-root userspace?
> 
> Imagine a process that is willing to accept the cpu overhead for doing thp 
> collapse for portions of its memory in process context rather than waiting 
> for khugepaged and that we had a mechanism (discussed later) for doing 
> that in the kernel.  The non-root user in this case would need the ability 
> to monitor regions of its own heap, for example, and disregard others.  
> The malloc implementation wants to answer the question of "what regions of 
> my heap are accessed very frequently?" so that we can do hugepage 
> optimizations.
> 
> Do you see that the user will have the ability to fork off a DAMON context 
> to do this monitoring for their own heap?  kdamond could be attached to a 
> cpu cgroup to charge the cpu overhead for doing this monitoring and the 
> time spent applying any actions to that memory to that workload on a 
> multi-tenant machine.
> 
> I think it would be useful to discuss the role of non-root userspace for 
> future DAMON support.

Interesting points.  I haven't considered about the case in detail so far, but
I think your idea definitely makes sense.  I was also thinking we might end up
having DAMON syscalls in future.  It might make more sense to be used as the
interface for the non-root userspace.

> 
> > Imaginable DAMON-based Policies
> > ===============================
> > 
> > I'd like to start from listing some imaginable data access-aware operation
> > policies that I hope to eventually be made.  The list will hopefully shed light
> > on how DAMON should be evolved to efficiently support the policies.
> > 
> > DAMON-based Proactive LRU-pages (de)Activation
> > ----------------------------------------------
> > 
> > The reclamation mechanism which selects reclaim target using the
> > active/inactive LRU lists sometimes doesn't work well.  According to my
> > previous work, providing access pattern-based hints can significantly improve
> > the performance under memory pressure[1,2].
> > 
> > Proactive reclamation is known to be useful for many memory intensive systems,
> > and now we have a DAMON-based implementation of it[3].  However, the proactive
> > reclamation wouldn't be so welcome to some systems having high cost of I/O.
> > Also, even though the system runs proactive reclamation, memory pressure can
> > still occasionally triggered.
> > 
> > My idea for helping this situation is manipulating the orders of pages in LRU
> > lists using DAMON-provided monitoring results.  That is, making DAMON
> > proactively finds hot/cold memory regions and moves pages of the hot regions to
> > the head of the active list, while moving pages of the cold regions to the tail
> > of the inactive list.  This will help eventual reclamation under memory
> > pressure to evict cold pages first, so incur less additional page faults.
> > 
> 
> Let's add Johannes Weiner <hannes@cmpxchg.org> into this discussion as 
> well since we had previously discussed persistent background ordering of 
> the lru lists based on hotness and coldness of memory before.  This 
> discussion had happened before DAMON was merged upstream, so that DAMON 
> has landed it is likely an area that he's interested in.
> 
> One gotcha with the above might be the handling of MADV_FREE memory that 
> we want to lazily free under memory pressure.  Userspace has indicated 
> that we can free this memory whenever necessary, so the kernel 
> implementation moves this memory to the inactive lru regardless of any 
> hotness or coldness of the memory.  In other words, this memory *can* have 
> very high access frequencies in the short-term and then it's madvised with 
> MADV_FREE by userspace to free if we encounter memory pressure.  It seems 
> like this needs to override the DAMON-provided monitoring results since 
> userspace just knows better in certain scenarios.

Interesting case.  Similarly, some of our customers told us that they don't
want DAMON_RECLAIM to affect some special processes that managing their memory
in their highly optimized way.  To deal with this kind of situations, I'm
thinking about adding a sort of deny-list to DAMON-based Operation Schemes.
With that, users would be able to specify to which memory region (e.g., memory
regions of specific process, cgroup, pfn range, ...) each scheme shouldn't
apply its action.  So, in this case, the program would be able to avoid DAMON's
interference by adding the region to apply 'MADV_FREE' to the deny-list of
relevant DAMON-based operation scheme before calling 'madvise()'.

> 
> > [1] https://www.usenix.org/conference/hotstorage19/presentation/park
> > [2] https://linuxplumbersconf.org/event/4/contributions/548/
> > [3] https://docs.kernel.org/admin-guide/mm/damon/reclaim.html
> > 
> > DAMON-based THP Coalesce/Split
> > ------------------------------
> > 
> > THP is know to significantly improve performance, but also increase memory
> > footprint[1].  We can minimize the memory overhead while preserving the
> > performance benefit by asking DAMON to provide MADV_HUGEPAGE-like hints for hot
> > memory regions of >= 2MiB size, and MADV_NOHUGEPAGE-like hints for cold memory
> > regions.  Our experimental user space policy implementation[2] of this idea
> > removes 76.15% of THP memory waste while preserving 51.25% of THP speedup in
> > total.
> > 
> 
> This is a very interesting area to explore, and turns out to be very 
> timely as well.  We'll soon be proposing the MADV_COLLAPSE support that we 
> discussed here[1] and was well received.
> 
> One thought here is that with DAMON we can create a scheme to apply a 
> DAMOS_COLLAPSE action on very hot memory in the monitoring region that 
> would simply call into the new MADV_COLLAPSE code to allow us to do a 
> synchronous collapse in process context.  With the current DAMON support, 
> this seems very straight-forward once we have MADV_COLLAPSE.
> 
> [1] https://lore.kernel.org/all/d098c392-273a-36a4-1a29-59731cdf5d3d@google.com/

I also agree the synchronous and speedy THP collapse/split will be helpful for
application-specific usage, and what you described above is almost same to what
I'm planning to do.  Looking forward to MADV_COLLAPSE patch!

BTW, I'm also interested in the system-wide long term usage of the policy; the
slow speed of khugepaged seems not a big problem for the case.  I also recently
started thinking it might be more simple and make more sense to do the
proactive works for only collapse or split instead of doing those together,
depending on the system's THP setup.

For example, if '/sys/kernel/mm/transparent_hugepage/enabled' is set as
'always', we could simply find cold memory regions and mark those with
NOHUGEPAGE hints to reduce THP internal fragmentation caused memory bloat,
under memory pressure.  If the file is set as 'madvise', we could find hot
memory regions and mark those with HUGEPAGE hints to reduce TLB misses, while
free memory ratio of the system is big.

> 
> > [1] https://www.usenix.org/conference/osdi16/technical-sessions/presentation/kwon
> > [2] https://damonitor.github.io/doc/html/v34/vm/damon/eval.html
> > 
> > DAMON-based Tiered Memory (Pro|De)motion
> > ----------------------------------------
> > 
> > In tiered memory systems utilizing DRAM and PMEM[1], we can promote hot pages to
> > DRAM and demote cold pages to PMEM using DAMON.  A patch for allowing
> > access-aware demotion user space policy development is already submitted[2] by
> > Baolin.
> > 
> 
> Thanks for this, it's very useful.  Is it possible to point to any data on 
> how responsive the promotion side can be to recent memory accesses?  It 
> seems like we'll need to promote that memory quite quickly to not suffer 
> long-lived performance degradations if we're treating DRAM and PMEM as 
> schedulable memory.
> 
> DAMON provides us with a framework so that we have complete control over 
> the efficiency of scanning PMEM for possible promotion candidates.  But 
> I'd be very interested in seeing any data from Baolin (or anybody else) on 
> just how responsive the promotion side can be.

Totally agreed.  I think the idea makes some sense, but it's useless without
data.  This was in my TODO list since the beginning of DAMON, but I was too
lazy to do that.  I even couldn't start the test environment setup survey yet.
Also, this is not yet prioritized among other tasks in my TODO list.  If anyone
could provide any PoC results or easy-to-start DRAM/PMEM test machine setup
instructions, it would be great.  Long story short, I don't have any data.  Any
data or help will be welcome.

> 
> > [1] https://www.intel.com/content/www/us/en/products/details/memory-storage/optane-memory.html
> > [2] https://lore.kernel.org/linux-mm/cover.1640171137.git.baolin.wang@linux.alibaba.com/
> > 
> > DAMON-based Proactive Compaction
> > --------------------------------
> > 
> > Compaction uses migration scanner to find migration source pages.  Hot pages
> > would be more likely to be unmovable compared to cold pages, so it would be
> > better to try migration of cold pages first.  DAMON could be used here.  That
> > is, proactively monitoring accesses via DAMON and start compaction so that the
> > migration scanner scan cold memory ranges first.  I should admit I'm not
> > familiar with compaction code and I have no PoC data for this but just the
> > groundless idea, though.
> > 
> 
> Is compaction enlightenment for DAMON a high priority at this point, or 
> would AutoNUMA be a more interesting candidate?
> 
> Today, AutoNUMA works with a sliding window setting page tables to have 
> PROT_NONE permissions so that we induce a page fault and can determine 
> which cpu is accessing potentially remote memory (task_numa_work()).  If 
> that's happening, we can migrate the memory to the home NUMA node so that 
> we can avoid those remote memory accesses and the increased latency that 
> it induces.

I might missing something from your point, but what I hope to achieve with this
is faster and more successful defragmentation, not reduction of remote-NUMA
accesses.  Applying DAMON for enlightening AutoNUMA is also an interesting
idea, though.

> 
> Idea: if we enlightened task_numa_work() to prioritize hot memory using 
> DAMON, it *seems* like this would be most effective rather than relying on 
> a sliding window.  We want to migrate memory that is frequently being 
> accessed to reduce the remote memory access latency, we only get a minimal 
> improvement (mostly only node balancing) for memory that is rarely 
> accessed.
> 
> I'm somewhat surprised this isn't one of the highest priorities, actually, 
> for being enlightened with DAMON support, so it feels like I'm missing 
> something obvious.
> 
> Let's also add Dave Hansen <dave.hansen@linux.intel.com> into the thread 
> for the above two sections (memory tiering and AutoNUMA) because I know 
> he's thought about both.

AutoNUMA would need to know not only how frequently the memory regions is
accessed, but also which CPUs are how frequently accessing the memory regions.
Currently, DAMON doesn't provide the CPU-related information.  I think DAMON
could be extended for the case, by using the page fault mechanism as its basic
access check primitive instead of Accessed bits.  It would doable as DAMON is
designed to support such extension, but would need some additional efforts.

> 
> > How We Can Implement These
> > --------------------------
> > 
> > Implementing most of the above mentioned policies wouldn't be too difficult
> > because we have DAMON-based Operation Schemes (DAMOS).  That is, we will need
> > to implement some more DAMOS action for each policy.  Some existing kernel
> > functions can be reused.  Such actions would include LRU (de)activation, THP
> > coalesce/split hints, memory (pro|de)motion, and cold pages first scanning
> > compaction.  Then, supporting those actions with the user space interface will
> > allows implementing user space policies.  If we find reasonably good default
> > DAMOS parameters and some kernel side control mechanism, we can further make
> > those as kernel policies in form of, say, builtin modules.
> > 
> > How DAMON Should Be Evolved For Supporting Those
> > ================================================
> > 
> > Let's discuss what kind of changes in DAMON will be needed to efficiently
> > support above mentioned policies.
> > 
> > Simultaneously Monitoring Different Types of Address Spaces
> > -----------------------------------------------------------
> > 
> > It would be better to run all the above mentioned policies simultaneously on
> > single system.  As some policies such as LRU-pages (de)activation would better
> > to run on physical address space while some policies such as THP coalesce/split
> > would need to run on virtual address spaces, DAMON should support concurrently
> > monitoring different address spaces.  We can always do this by creating one
> > DAMON context for each address space and running those.  However, as the
> > address spaces will conflict, each other will be interfered.  Current idea for
> > avoiding this is allowing multiple DAMON contexts to run on a single thread,
> > forcing them to have same monitoring contexts.
> > 
> > Online Parameters Updates
> > -------------------------
> > 
> > Someone would also want to dynamically turn on/off and/or tune each policy.
> > This is impossible with current DAMON, because it prohibits updating any
> > parameter while it is running.  We disallow the online parameters update
> > mainly because we want to avoid doing additional synchronization between the
> > running kdamond and the parameters updater.  The idea for supporting the use
> > case while avoiding the additional synchronization is, allowing users to pause
> > DAMON and update parameters while it is paused.
> > 
> > A Better DAMON interface
> > ------------------------
> > 
> > DAMON is currently exposing its major functionality to the user space via the
> > debugfs.  After all, DAMON is not for only debugging.  Also, this makes the
> > interface depends on debugfs unnecessarily, and considered unreliable.  Also,
> > the interface is quite unflexible for future interface extension.  I admit it
> > was not a good choice.
> > 
> > It would be better to implement another reliable and easily extensible
> > interface, and deprecate the debugfs interface.  The idea is exposing the
> > interface via sysfs using hierarchical Kobjects under mm_kobject.  For example,
> > the usage would be something like below:
> > 
> >     # cd /sys/kernel/mm/damon
> >     # echo 1 > nr_kdamonds
> >     # echo 1 > kdamond_1/contexts/nr_contexts
> >     # echo va > kdamond_1/contexts/context_1/target_type
> >     # echo 1 > kdamond_1/contexts/context_1/targets/nr_targets
> >     # echo $(pidof <workload>) > \
> >                     kdamond_1/contexts/context_1/targets/target_1/pid
> >     # echo Y > monitor_on
> > 
> > The underlying files hierarchy could be something like below.
> > 
> >     /sys/kernel/mm/damon/
> >     │ monitor_on
> >     │ kdamonds
> >     │ │ nr_kdamonds
> >     │ │ kdamond_1/
> >     │ │ │ kdamond_pid
> >     │ │ │ contexts
> >     │ │ │ │ nr_contexts
> >     │ │ │ │ context_1/
> >     │ │ │ │ │ target_type (va | pa)
> >     │ │ │ │ │ attrs/
> >     │ │ │ │ │ │ intervals/sampling,aggr,update
> >     │ │ │ │ │ │ nr_regions/min,max
> >     │ │ │ │ │ targets/
> >     │ │ │ │ │ │ nr_targets
> >     │ │ │ │ │ │ target_1/
> >     │ │ │ │ │ │ │ pid
> >     │ │ │ │ │ │ │ init_regions/
> >     │ │ │ │ │ │ │ │ region1/
> >     │ │ │ │ │ │ │ │ │ start,end
> >     │ │ │ │ │ │ │ │ ...
> >     │ │ │ │ │ │ ...
> >     │ │ │ │ │ schemes/
> >     │ │ │ │ │ │ nr_schemes
> >     │ │ │ │ │ │ scheme_1/
> >     │ │ │ │ │ │ │ action
> >     │ │ │ │ │ │ │ target_access_pattern/
> >     │ │ │ │ │ │ │ │ sz/min,max
> >     │ │ │ │ │ │ │ │ nr_accesses/min,max
> >     │ │ │ │ │ │ │ │ age/min,max
> >     │ │ │ │ │ │ │ quotas/
> >     │ │ │ │ │ │ │ │ ms,bytes,reset_interval
> >     │ │ │ │ │ │ │ │ prioritization_weights/
> >     │ │ │ │ │ │ │ │   sz,nr_accesses,age
> >     │ │ │ │ │ │ │ watermarks/
> >     │ │ │ │ │ │ │   metric,check_interval,high,mid,low
> >     │ │ │ │ │ │ │ stats/
> >     │ │ │ │ │ │ │ │ quota_exceeds
> >     │ │ │ │ │ │ │ │ tried/nr,sz
> >     │ │ │ │ │ │ │ │ applied/nr,sz
> >     │ │ │ │ │ │ │ ...
> >     │ │ │ │ ...
> >     │ │ ...
> > 
> > More DAMON Future Works
> > =======================
> > 
> > In addition to above mentioned things, there are many works to do.  It would be
> > better to extend DAMON for more use cases and address spaces support, including
> > page granularity, idleness only, read/write only, page cache only, and cgroups
> > monitoring supports.
> > 
> 
> Cgroup support is very interesting so that we do not need to constantly 
> maintain a list of target_ids when a job forks new processes.  We've 
> discussed the potential for passing a cgroup inode as the target rather 
> than pid for virtual address monitoring that would operate over the set of 
> processes attached to that cgroup hierarchy.  Is this what you imagine for 
> cgroup support or something more elaborate (or something different 
> entirely :)?

You're correct.  That's my current idea.

> 
> > Also it would be valuable to improve the accuracy of monitoring, using some
> > adaptive monitoring attributes tuning or some new fancy idea[1].
> > 
> > DAMOS could also be improved by utilizing its own autotuning feature, for
> > example, by monitoring PSI and other metrics related to the given action.
> > 
> > [1] https://linuxplumbersconf.org/event/11/contributions/984/
> > 
> 
> I'd like to add another topic here: DAMON based monitoring for virtualized 
> workloads.  Today, it seems like you'd need to run DAMON in the guest to 
> be able to describe its working set.  Monitoring the hypervisor process 
> is inadequate because it will reveal the first access to the guest owned 
> memory but not the accesses done by the guest itself.  So it seems like 
> the *current* support for virtual address monitoring is insufficient 
> unless the guest is enlightened to do DAMON monitoring itself.
> 
> What about unenlightened guests?  An idea is a third DAMON monitoring mode 
> that monitors accesses in the EPT.  Have you thought about this before or 
> other ways to monitor memory access for an *unenlightened* guest?  Would 
> love to have a discussion on this.

We're checking guest-internal accesses via 'mmu_notifier_clear_young()', and I
confirmed[1] it allows DAMON on host to collect data accesses in KVM/QEMU
guests.  I'm not heavily testing/using the case, though.

[1] https://lore.kernel.org/linux-mm/CALvZod61Dx4emiV5H73mQcFN6WvmD4A2Z=sRfmN2qpBh3R-_kQ@mail.gmail.com/

Thank you again for above greatful comments, David.  If you have more
questions/comments, or you find anything I'm missing, please let me know.


Thanks,
SJ

Re: [RFC PLAN] Some humble ideas for DAMON future works

[David Rientjes]

[-- Attachment #1: Type: text/plain, Size: 25286 bytes --]

On Fri, 28 Jan 2022, SeongJae Park wrote:

> > > I think the first opinion makes sense as there are some valuable information
> > > that only user space can know.  I think only such approaches could achieve the
> > > ultimate efficiency in such cases.
> > > I also agree to the second party, though, because there could be some people
> > > who don't have special information that only their applications know, or
> > > resources to do the additional work.  In-kernel simple policies will be still
> > > beneficial for some users even though those are sub-optimal compared to the
> > > highly tuned user space policy, if it provides some extent of efficiency gain
> > > and no regressions for most cases.
> > > 
> > > I'd like to help both.  For the reason, I made DAMON as an in-kernel mechanism
> > > for both user and kernel-space policies.  It provides highly tunable general
> > > user space interface to help the first party.  It also provides in-kernel
> > > policies which built on top of DAMON using its kernel-space API for specific
> > > common use cases with conservative default parameters that assumed to incur no
> > > regression but some extent of benefits in most cases, namely DAMON-based
> > > proactive reclamation.  I will continue pursuing the two ways.
> > > 
> > 
> > Are you referring only to root userspace here or are you including 
> > non-root userspace?
> > 
> > Imagine a process that is willing to accept the cpu overhead for doing thp 
> > collapse for portions of its memory in process context rather than waiting 
> > for khugepaged and that we had a mechanism (discussed later) for doing 
> > that in the kernel.  The non-root user in this case would need the ability 
> > to monitor regions of its own heap, for example, and disregard others.  
> > The malloc implementation wants to answer the question of "what regions of 
> > my heap are accessed very frequently?" so that we can do hugepage 
> > optimizations.
> > 
> > Do you see that the user will have the ability to fork off a DAMON context 
> > to do this monitoring for their own heap?  kdamond could be attached to a 
> > cpu cgroup to charge the cpu overhead for doing this monitoring and the 
> > time spent applying any actions to that memory to that workload on a 
> > multi-tenant machine.
> > 
> > I think it would be useful to discuss the role of non-root userspace for 
> > future DAMON support.
> 
> Interesting points.  I haven't considered about the case in detail so far, but
> I think your idea definitely makes sense.  I was also thinking we might end up
> having DAMON syscalls in future.  It might make more sense to be used as the
> interface for the non-root userspace.
> 

Yeah, non-root userspace having access to an interface so that it can 
construct a heat map of its own memory would be useful if we are not able 
to fork off a DAMON context of our own.

One potential benefit of managing the DAMON context by non-root userspace 
itself is that we can confine the monitoring overhead to only regions of 
interest.  A malloc implementation may not be interested even in some 
areas of its own heap, for example, because we can make assumptions.  Two 
possibilities that I can think of: (1) portions of a malloc arena that 
pack many small objects together so the likelihood of at least one access 
during a sampling period is high, so not necessary to monitor for certain 
schemes and (2) the malloc implementaton wants to make hints that some 
areas of its heap are more interesting than others to monitor because of 
application specific behavior.

Supporting only a non-root interface to generate a heat map may otherwise 
incur unnecessary monitoring overhead.  And if non-root userspace can't 
fork off its own context, this monitoring overhead seems like it would be 
charged to the system as a whole and that might not be desired.

> > > DAMON-based Proactive LRU-pages (de)Activation
> > > ----------------------------------------------
> > > 
> > > The reclamation mechanism which selects reclaim target using the
> > > active/inactive LRU lists sometimes doesn't work well.  According to my
> > > previous work, providing access pattern-based hints can significantly improve
> > > the performance under memory pressure[1,2].
> > > 
> > > Proactive reclamation is known to be useful for many memory intensive systems,
> > > and now we have a DAMON-based implementation of it[3].  However, the proactive
> > > reclamation wouldn't be so welcome to some systems having high cost of I/O.
> > > Also, even though the system runs proactive reclamation, memory pressure can
> > > still occasionally triggered.
> > > 
> > > My idea for helping this situation is manipulating the orders of pages in LRU
> > > lists using DAMON-provided monitoring results.  That is, making DAMON
> > > proactively finds hot/cold memory regions and moves pages of the hot regions to
> > > the head of the active list, while moving pages of the cold regions to the tail
> > > of the inactive list.  This will help eventual reclamation under memory
> > > pressure to evict cold pages first, so incur less additional page faults.
> > > 
> > 
> > Let's add Johannes Weiner <hannes@cmpxchg.org> into this discussion as 
> > well since we had previously discussed persistent background ordering of 
> > the lru lists based on hotness and coldness of memory before.  This 
> > discussion had happened before DAMON was merged upstream, so that DAMON 
> > has landed it is likely an area that he's interested in.
> > 
> > One gotcha with the above might be the handling of MADV_FREE memory that 
> > we want to lazily free under memory pressure.  Userspace has indicated 
> > that we can free this memory whenever necessary, so the kernel 
> > implementation moves this memory to the inactive lru regardless of any 
> > hotness or coldness of the memory.  In other words, this memory *can* have 
> > very high access frequencies in the short-term and then it's madvised with 
> > MADV_FREE by userspace to free if we encounter memory pressure.  It seems 
> > like this needs to override the DAMON-provided monitoring results since 
> > userspace just knows better in certain scenarios.
> 
> Interesting case.  Similarly, some of our customers told us that they don't
> want DAMON_RECLAIM to affect some special processes that managing their memory
> in their highly optimized way.  To deal with this kind of situations, I'm
> thinking about adding a sort of deny-list to DAMON-based Operation Schemes.
> With that, users would be able to specify to which memory region (e.g., memory
> regions of specific process, cgroup, pfn range, ...) each scheme shouldn't
> apply its action.  So, in this case, the program would be able to avoid DAMON's
> interference by adding the region to apply 'MADV_FREE' to the deny-list of
> relevant DAMON-based operation scheme before calling 'madvise()'.
> 

Correct me if I'm wrong, but the reason that DAMON_RECLAIM uses paddr is 
because it can track unmapped memory that is otherwise not accessible if 
using virtual address space monitoring.

Deny-lists might be hard, it seems, if we need to continually manipulate 
the set of pids or set of cgroups that are opt-in and opt-out of 
DAMON_RECLAIM without restructuring the entire cgroup hierarchy into 
top-level damon_reclaimable and damon_unreclaimable cgroups :)

One idea might be to reimplement DAMON_RECLAIM to use virtual addresss 
space monitoring, but I might be missing some of the details that preclude 
this.  It would *seem* that DAMON_RECLAIM could be a context composed of 
multiple targets that are opt-in, whether pids or cgroups, to being 
reclaimed and amongst them there could be a prioritization scheme to 
indicate which targets we want to reclaim from more or less aggressively.  

A secondary target could provide paddr monitoring but only for unmapped 
memory that would not be scanned by the virtual address space monitors and 
this would have its own prioritization scheme that can be compared with 
the other targets.

But I feel like I'm missing something more fundamental about why 
DAMON_RECLAIM must be paddr and we then need to support deny-lists that 
might be more flexibly handled if done with virtual address space scanning 
with a set of targets that opt-in.

> > > DAMON-based THP Coalesce/Split
> > > ------------------------------
> > > 
> > > THP is know to significantly improve performance, but also increase memory
> > > footprint[1].  We can minimize the memory overhead while preserving the
> > > performance benefit by asking DAMON to provide MADV_HUGEPAGE-like hints for hot
> > > memory regions of >= 2MiB size, and MADV_NOHUGEPAGE-like hints for cold memory
> > > regions.  Our experimental user space policy implementation[2] of this idea
> > > removes 76.15% of THP memory waste while preserving 51.25% of THP speedup in
> > > total.
> > > 
> > 
> > This is a very interesting area to explore, and turns out to be very 
> > timely as well.  We'll soon be proposing the MADV_COLLAPSE support that we 
> > discussed here[1] and was well received.
> > 
> > One thought here is that with DAMON we can create a scheme to apply a 
> > DAMOS_COLLAPSE action on very hot memory in the monitoring region that 
> > would simply call into the new MADV_COLLAPSE code to allow us to do a 
> > synchronous collapse in process context.  With the current DAMON support, 
> > this seems very straight-forward once we have MADV_COLLAPSE.
> > 
> > [1] https://lore.kernel.org/all/d098c392-273a-36a4-1a29-59731cdf5d3d@google.com/
> 
> I also agree the synchronous and speedy THP collapse/split will be helpful for
> application-specific usage, and what you described above is almost same to what
> I'm planning to do.  Looking forward to MADV_COLLAPSE patch!
> 

Adding Zach O'Keefe <zokeefe@google.com> who should be sending this out 
shortly.  We'll be interested in your code review.

> BTW, I'm also interested in the system-wide long term usage of the policy; the
> slow speed of khugepaged seems not a big problem for the case.  I also recently
> started thinking it might be more simple and make more sense to do the
> proactive works for only collapse or split instead of doing those together,
> depending on the system's THP setup.
> 
> For example, if '/sys/kernel/mm/transparent_hugepage/enabled' is set as
> 'always', we could simply find cold memory regions and mark those with
> NOHUGEPAGE hints to reduce THP internal fragmentation caused memory bloat,
> under memory pressure.  If the file is set as 'madvise', we could find hot
> memory regions and mark those with HUGEPAGE hints to reduce TLB misses, while
> free memory ratio of the system is big.
> 

Ah, yes, this is a slightly different motivation.  Our use of 
max_ptes_none == 0 fixes the memory bloat problem for us :)  With 
MADV_COLLAPSE, however, this perhaps may be better handled by a userspace 
collapser instead of khugepaged since we can inform userspace of job 
priorities and those that can or cannot handle the memory bloat.  In other 
words, we no longer need to be lockd into a single max_ptes_none value for 
the entire system if we are to explore a userspace collapser.

> > 
> > > [1] https://www.usenix.org/conference/osdi16/technical-sessions/presentation/kwon
> > > [2] https://damonitor.github.io/doc/html/v34/vm/damon/eval.html
> > > 
> > > DAMON-based Tiered Memory (Pro|De)motion
> > > ----------------------------------------
> > > 
> > > In tiered memory systems utilizing DRAM and PMEM[1], we can promote hot pages to
> > > DRAM and demote cold pages to PMEM using DAMON.  A patch for allowing
> > > access-aware demotion user space policy development is already submitted[2] by
> > > Baolin.
> > > 
> > 
> > Thanks for this, it's very useful.  Is it possible to point to any data on 
> > how responsive the promotion side can be to recent memory accesses?  It 
> > seems like we'll need to promote that memory quite quickly to not suffer 
> > long-lived performance degradations if we're treating DRAM and PMEM as 
> > schedulable memory.
> > 
> > DAMON provides us with a framework so that we have complete control over 
> > the efficiency of scanning PMEM for possible promotion candidates.  But 
> > I'd be very interested in seeing any data from Baolin (or anybody else) on 
> > just how responsive the promotion side can be.
> 
> Totally agreed.  I think the idea makes some sense, but it's useless without
> data.  This was in my TODO list since the beginning of DAMON, but I was too
> lazy to do that.  I even couldn't start the test environment setup survey yet.
> Also, this is not yet prioritized among other tasks in my TODO list.  If anyone
> could provide any PoC results or easy-to-start DRAM/PMEM test machine setup
> instructions, it would be great.  Long story short, I don't have any data.  Any
> data or help will be welcome.
> 
> > 
> > > [1] https://www.intel.com/content/www/us/en/products/details/memory-storage/optane-memory.html
> > > [2] https://lore.kernel.org/linux-mm/cover.1640171137.git.baolin.wang@linux.alibaba.com/
> > > 
> > > DAMON-based Proactive Compaction
> > > --------------------------------
> > > 
> > > Compaction uses migration scanner to find migration source pages.  Hot pages
> > > would be more likely to be unmovable compared to cold pages, so it would be
> > > better to try migration of cold pages first.  DAMON could be used here.  That
> > > is, proactively monitoring accesses via DAMON and start compaction so that the
> > > migration scanner scan cold memory ranges first.  I should admit I'm not
> > > familiar with compaction code and I have no PoC data for this but just the
> > > groundless idea, though.
> > > 
> > 
> > Is compaction enlightenment for DAMON a high priority at this point, or 
> > would AutoNUMA be a more interesting candidate?
> > 
> > Today, AutoNUMA works with a sliding window setting page tables to have 
> > PROT_NONE permissions so that we induce a page fault and can determine 
> > which cpu is accessing potentially remote memory (task_numa_work()).  If 
> > that's happening, we can migrate the memory to the home NUMA node so that 
> > we can avoid those remote memory accesses and the increased latency that 
> > it induces.
> 
> I might missing something from your point, but what I hope to achieve with this
> is faster and more successful defragmentation, not reduction of remote-NUMA
> accesses.  Applying DAMON for enlightening AutoNUMA is also an interesting
> idea, though.
> 

Yeah, sorry, I conflated your proactive compaction topic with AutoNUMA :/

I'm not sure that I fully understand the point about hot pages being more 
likely to be unmovable.  There may be optimizations possible in migrating 
cold pages first, but I don't believe hotness implies that a page becomes 
fully unmovable as a result of its access frequency.

> > Idea: if we enlightened task_numa_work() to prioritize hot memory using 
> > DAMON, it *seems* like this would be most effective rather than relying on 
> > a sliding window.  We want to migrate memory that is frequently being 
> > accessed to reduce the remote memory access latency, we only get a minimal 
> > improvement (mostly only node balancing) for memory that is rarely 
> > accessed.
> > 
> > I'm somewhat surprised this isn't one of the highest priorities, actually, 
> > for being enlightened with DAMON support, so it feels like I'm missing 
> > something obvious.
> > 
> > Let's also add Dave Hansen <dave.hansen@linux.intel.com> into the thread 
> > for the above two sections (memory tiering and AutoNUMA) because I know 
> > he's thought about both.
> 
> AutoNUMA would need to know not only how frequently the memory regions is
> accessed, but also which CPUs are how frequently accessing the memory regions.
> Currently, DAMON doesn't provide the CPU-related information.  I think DAMON
> could be extended for the case, by using the page fault mechanism as its basic
> access check primitive instead of Accessed bits.  It would doable as DAMON is
> designed to support such extension, but would need some additional efforts.
> 

Yeah, I meant that we keep the current mechanism that allows AutoNUMA to 
determine its optimal node by setting ptes to have PROT_NONE and inducing 
a page fault so that we can determine the cpu, and thereby its NUMA node, 
that is accessing it.

The idea for DAMON enlightenment here is that we can do better than the 
simple sliding window that AutoNUMA currently uses.  In other words, 
prefer to set hot memory to have PROT_NONE so that we can optimize the 
node placement of frequently accessed memory first rather than simply 
iterating through memory as though it all has the same access frequency 
setting PROT_NONE.

This would need some more complexities, though, since the same memory 
might consistently be hot and then we've succeeded in doing nothing but 
inducing non-stop page faults for very hot memory :)

> > 
> > > How We Can Implement These
> > > --------------------------
> > > 
> > > Implementing most of the above mentioned policies wouldn't be too difficult
> > > because we have DAMON-based Operation Schemes (DAMOS).  That is, we will need
> > > to implement some more DAMOS action for each policy.  Some existing kernel
> > > functions can be reused.  Such actions would include LRU (de)activation, THP
> > > coalesce/split hints, memory (pro|de)motion, and cold pages first scanning
> > > compaction.  Then, supporting those actions with the user space interface will
> > > allows implementing user space policies.  If we find reasonably good default
> > > DAMOS parameters and some kernel side control mechanism, we can further make
> > > those as kernel policies in form of, say, builtin modules.
> > > 
> > > How DAMON Should Be Evolved For Supporting Those
> > > ================================================
> > > 
> > > Let's discuss what kind of changes in DAMON will be needed to efficiently
> > > support above mentioned policies.
> > > 
> > > Simultaneously Monitoring Different Types of Address Spaces
> > > -----------------------------------------------------------
> > > 
> > > It would be better to run all the above mentioned policies simultaneously on
> > > single system.  As some policies such as LRU-pages (de)activation would better
> > > to run on physical address space while some policies such as THP coalesce/split
> > > would need to run on virtual address spaces, DAMON should support concurrently
> > > monitoring different address spaces.  We can always do this by creating one
> > > DAMON context for each address space and running those.  However, as the
> > > address spaces will conflict, each other will be interfered.  Current idea for
> > > avoiding this is allowing multiple DAMON contexts to run on a single thread,
> > > forcing them to have same monitoring contexts.
> > > 
> > > Online Parameters Updates
> > > -------------------------
> > > 
> > > Someone would also want to dynamically turn on/off and/or tune each policy.
> > > This is impossible with current DAMON, because it prohibits updating any
> > > parameter while it is running.  We disallow the online parameters update
> > > mainly because we want to avoid doing additional synchronization between the
> > > running kdamond and the parameters updater.  The idea for supporting the use
> > > case while avoiding the additional synchronization is, allowing users to pause
> > > DAMON and update parameters while it is paused.
> > > 
> > > A Better DAMON interface
> > > ------------------------
> > > 
> > > DAMON is currently exposing its major functionality to the user space via the
> > > debugfs.  After all, DAMON is not for only debugging.  Also, this makes the
> > > interface depends on debugfs unnecessarily, and considered unreliable.  Also,
> > > the interface is quite unflexible for future interface extension.  I admit it
> > > was not a good choice.
> > > 
> > > It would be better to implement another reliable and easily extensible
> > > interface, and deprecate the debugfs interface.  The idea is exposing the
> > > interface via sysfs using hierarchical Kobjects under mm_kobject.  For example,
> > > the usage would be something like below:
> > > 
> > >     # cd /sys/kernel/mm/damon
> > >     # echo 1 > nr_kdamonds
> > >     # echo 1 > kdamond_1/contexts/nr_contexts
> > >     # echo va > kdamond_1/contexts/context_1/target_type
> > >     # echo 1 > kdamond_1/contexts/context_1/targets/nr_targets
> > >     # echo $(pidof <workload>) > \
> > >                     kdamond_1/contexts/context_1/targets/target_1/pid
> > >     # echo Y > monitor_on
> > > 
> > > The underlying files hierarchy could be something like below.
> > > 
> > >     /sys/kernel/mm/damon/
> > >     │ monitor_on
> > >     │ kdamonds
> > >     │ │ nr_kdamonds
> > >     │ │ kdamond_1/
> > >     │ │ │ kdamond_pid
> > >     │ │ │ contexts
> > >     │ │ │ │ nr_contexts
> > >     │ │ │ │ context_1/
> > >     │ │ │ │ │ target_type (va | pa)
> > >     │ │ │ │ │ attrs/
> > >     │ │ │ │ │ │ intervals/sampling,aggr,update
> > >     │ │ │ │ │ │ nr_regions/min,max
> > >     │ │ │ │ │ targets/
> > >     │ │ │ │ │ │ nr_targets
> > >     │ │ │ │ │ │ target_1/
> > >     │ │ │ │ │ │ │ pid
> > >     │ │ │ │ │ │ │ init_regions/
> > >     │ │ │ │ │ │ │ │ region1/
> > >     │ │ │ │ │ │ │ │ │ start,end
> > >     │ │ │ │ │ │ │ │ ...
> > >     │ │ │ │ │ │ ...
> > >     │ │ │ │ │ schemes/
> > >     │ │ │ │ │ │ nr_schemes
> > >     │ │ │ │ │ │ scheme_1/
> > >     │ │ │ │ │ │ │ action
> > >     │ │ │ │ │ │ │ target_access_pattern/
> > >     │ │ │ │ │ │ │ │ sz/min,max
> > >     │ │ │ │ │ │ │ │ nr_accesses/min,max
> > >     │ │ │ │ │ │ │ │ age/min,max
> > >     │ │ │ │ │ │ │ quotas/
> > >     │ │ │ │ │ │ │ │ ms,bytes,reset_interval
> > >     │ │ │ │ │ │ │ │ prioritization_weights/
> > >     │ │ │ │ │ │ │ │   sz,nr_accesses,age
> > >     │ │ │ │ │ │ │ watermarks/
> > >     │ │ │ │ │ │ │   metric,check_interval,high,mid,low
> > >     │ │ │ │ │ │ │ stats/
> > >     │ │ │ │ │ │ │ │ quota_exceeds
> > >     │ │ │ │ │ │ │ │ tried/nr,sz
> > >     │ │ │ │ │ │ │ │ applied/nr,sz
> > >     │ │ │ │ │ │ │ ...
> > >     │ │ │ │ ...
> > >     │ │ ...
> > > 
> > > More DAMON Future Works
> > > =======================
> > > 
> > > In addition to above mentioned things, there are many works to do.  It would be
> > > better to extend DAMON for more use cases and address spaces support, including
> > > page granularity, idleness only, read/write only, page cache only, and cgroups
> > > monitoring supports.
> > > 
> > 
> > Cgroup support is very interesting so that we do not need to constantly 
> > maintain a list of target_ids when a job forks new processes.  We've 
> > discussed the potential for passing a cgroup inode as the target rather 
> > than pid for virtual address monitoring that would operate over the set of 
> > processes attached to that cgroup hierarchy.  Is this what you imagine for 
> > cgroup support or something more elaborate (or something different 
> > entirely :)?
> 
> You're correct.  That's my current idea.
> 
> > 
> > > Also it would be valuable to improve the accuracy of monitoring, using some
> > > adaptive monitoring attributes tuning or some new fancy idea[1].
> > > 
> > > DAMOS could also be improved by utilizing its own autotuning feature, for
> > > example, by monitoring PSI and other metrics related to the given action.
> > > 
> > > [1] https://linuxplumbersconf.org/event/11/contributions/984/
> > > 
> > 
> > I'd like to add another topic here: DAMON based monitoring for virtualized 
> > workloads.  Today, it seems like you'd need to run DAMON in the guest to 
> > be able to describe its working set.  Monitoring the hypervisor process 
> > is inadequate because it will reveal the first access to the guest owned 
> > memory but not the accesses done by the guest itself.  So it seems like 
> > the *current* support for virtual address monitoring is insufficient 
> > unless the guest is enlightened to do DAMON monitoring itself.
> > 
> > What about unenlightened guests?  An idea is a third DAMON monitoring mode 
> > that monitors accesses in the EPT.  Have you thought about this before or 
> > other ways to monitor memory access for an *unenlightened* guest?  Would 
> > love to have a discussion on this.
> 
> We're checking guest-internal accesses via 'mmu_notifier_clear_young()', and I
> confirmed[1] it allows DAMON on host to collect data accesses in KVM/QEMU
> guests.  I'm not heavily testing/using the case, though.
> 
> [1] https://lore.kernel.org/linux-mm/CALvZod61Dx4emiV5H73mQcFN6WvmD4A2Z=sRfmN2qpBh3R-_kQ@mail.gmail.com/
> 
> Thank you again for above greatful comments, David.  If you have more
> questions/comments, or you find anything I'm missing, please let me know.
> 
> 
> Thanks,
> SJ
> 

Re: [RFC PLAN] Some humble ideas for DAMON future works

[SeongJae Park]

On Sun, 30 Jan 2022 13:30:26 -0800 (PST) David Rientjes <rientjes@google.com> wrote:

> On Fri, 28 Jan 2022, SeongJae Park wrote:
> 
> > > > I think the first opinion makes sense as there are some valuable information
> > > > that only user space can know.  I think only such approaches could achieve the
> > > > ultimate efficiency in such cases.
> > > > I also agree to the second party, though, because there could be some people
> > > > who don't have special information that only their applications know, or
> > > > resources to do the additional work.  In-kernel simple policies will be still
> > > > beneficial for some users even though those are sub-optimal compared to the
> > > > highly tuned user space policy, if it provides some extent of efficiency gain
> > > > and no regressions for most cases.
> > > > 
> > > > I'd like to help both.  For the reason, I made DAMON as an in-kernel mechanism
> > > > for both user and kernel-space policies.  It provides highly tunable general
> > > > user space interface to help the first party.  It also provides in-kernel
> > > > policies which built on top of DAMON using its kernel-space API for specific
> > > > common use cases with conservative default parameters that assumed to incur no
> > > > regression but some extent of benefits in most cases, namely DAMON-based
> > > > proactive reclamation.  I will continue pursuing the two ways.
> > > > 
> > > 
> > > Are you referring only to root userspace here or are you including 
> > > non-root userspace?
> > > 
> > > Imagine a process that is willing to accept the cpu overhead for doing thp 
> > > collapse for portions of its memory in process context rather than waiting 
> > > for khugepaged and that we had a mechanism (discussed later) for doing 
> > > that in the kernel.  The non-root user in this case would need the ability 
> > > to monitor regions of its own heap, for example, and disregard others.  
> > > The malloc implementation wants to answer the question of "what regions of 
> > > my heap are accessed very frequently?" so that we can do hugepage 
> > > optimizations.
> > > 
> > > Do you see that the user will have the ability to fork off a DAMON context 
> > > to do this monitoring for their own heap?  kdamond could be attached to a 
> > > cpu cgroup to charge the cpu overhead for doing this monitoring and the 
> > > time spent applying any actions to that memory to that workload on a 
> > > multi-tenant machine.
> > > 
> > > I think it would be useful to discuss the role of non-root userspace for 
> > > future DAMON support.
> > 
> > Interesting points.  I haven't considered about the case in detail so far, but
> > I think your idea definitely makes sense.  I was also thinking we might end up
> > having DAMON syscalls in future.  It might make more sense to be used as the
> > interface for the non-root userspace.
> > 
> 
> Yeah, non-root userspace having access to an interface so that it can 
> construct a heat map of its own memory would be useful if we are not able 
> to fork off a DAMON context of our own.
> 
> One potential benefit of managing the DAMON context by non-root userspace 
> itself is that we can confine the monitoring overhead to only regions of 
> interest.  A malloc implementation may not be interested even in some 
> areas of its own heap, for example, because we can make assumptions.  Two 
> possibilities that I can think of: (1) portions of a malloc arena that 
> pack many small objects together so the likelihood of at least one access 
> during a sampling period is high, so not necessary to monitor for certain 
> schemes and (2) the malloc implementaton wants to make hints that some 
> areas of its heap are more interesting than others to monitor because of 
> application specific behavior.
> 
> Supporting only a non-root interface to generate a heat map may otherwise 
> incur unnecessary monitoring overhead.  And if non-root userspace can't 
> fork off its own context, this monitoring overhead seems like it would be 
> charged to the system as a whole and that might not be desired.

Agreed, this makes sense to me.

> 
> > > > DAMON-based Proactive LRU-pages (de)Activation
> > > > ----------------------------------------------
> > > > 
> > > > The reclamation mechanism which selects reclaim target using the
> > > > active/inactive LRU lists sometimes doesn't work well.  According to my
> > > > previous work, providing access pattern-based hints can significantly improve
> > > > the performance under memory pressure[1,2].
> > > > 
> > > > Proactive reclamation is known to be useful for many memory intensive systems,
> > > > and now we have a DAMON-based implementation of it[3].  However, the proactive
> > > > reclamation wouldn't be so welcome to some systems having high cost of I/O.
> > > > Also, even though the system runs proactive reclamation, memory pressure can
> > > > still occasionally triggered.
> > > > 
> > > > My idea for helping this situation is manipulating the orders of pages in LRU
> > > > lists using DAMON-provided monitoring results.  That is, making DAMON
> > > > proactively finds hot/cold memory regions and moves pages of the hot regions to
> > > > the head of the active list, while moving pages of the cold regions to the tail
> > > > of the inactive list.  This will help eventual reclamation under memory
> > > > pressure to evict cold pages first, so incur less additional page faults.
> > > > 
> > > 
> > > Let's add Johannes Weiner <hannes@cmpxchg.org> into this discussion as 
> > > well since we had previously discussed persistent background ordering of 
> > > the lru lists based on hotness and coldness of memory before.  This 
> > > discussion had happened before DAMON was merged upstream, so that DAMON 
> > > has landed it is likely an area that he's interested in.
> > > 
> > > One gotcha with the above might be the handling of MADV_FREE memory that 
> > > we want to lazily free under memory pressure.  Userspace has indicated 
> > > that we can free this memory whenever necessary, so the kernel 
> > > implementation moves this memory to the inactive lru regardless of any 
> > > hotness or coldness of the memory.  In other words, this memory *can* have 
> > > very high access frequencies in the short-term and then it's madvised with 
> > > MADV_FREE by userspace to free if we encounter memory pressure.  It seems 
> > > like this needs to override the DAMON-provided monitoring results since 
> > > userspace just knows better in certain scenarios.
> > 
> > Interesting case.  Similarly, some of our customers told us that they don't
> > want DAMON_RECLAIM to affect some special processes that managing their memory
> > in their highly optimized way.  To deal with this kind of situations, I'm
> > thinking about adding a sort of deny-list to DAMON-based Operation Schemes.
> > With that, users would be able to specify to which memory region (e.g., memory
> > regions of specific process, cgroup, pfn range, ...) each scheme shouldn't
> > apply its action.  So, in this case, the program would be able to avoid DAMON's
> > interference by adding the region to apply 'MADV_FREE' to the deny-list of
> > relevant DAMON-based operation scheme before calling 'madvise()'.
> > 
> 
> Correct me if I'm wrong, but the reason that DAMON_RECLAIM uses paddr is 
> because it can track unmapped memory that is otherwise not accessible if 
> using virtual address space monitoring.
> 
> Deny-lists might be hard, it seems, if we need to continually manipulate 
> the set of pids or set of cgroups that are opt-in and opt-out of 
> DAMON_RECLAIM without restructuring the entire cgroup hierarchy into 
> top-level damon_reclaimable and damon_unreclaimable cgroups :)
> 
> One idea might be to reimplement DAMON_RECLAIM to use virtual addresss 
> space monitoring, but I might be missing some of the details that preclude 
> this.  It would *seem* that DAMON_RECLAIM could be a context composed of 
> multiple targets that are opt-in, whether pids or cgroups, to being 
> reclaimed and amongst them there could be a prioritization scheme to 
> indicate which targets we want to reclaim from more or less aggressively.  
> 
> A secondary target could provide paddr monitoring but only for unmapped 
> memory that would not be scanned by the virtual address space monitors and 
> this would have its own prioritization scheme that can be compared with 
> the other targets.
> 
> But I feel like I'm missing something more fundamental about why 
> DAMON_RECLAIM must be paddr and we then need to support deny-lists that 
> might be more flexibly handled if done with virtual address space scanning 
> with a set of targets that opt-in.

DAMON_RECLAIM is an in-kernel policy for users who know their system is running
memory intensive workloads but don't want to do special memory optimization
works, and therefore just want the kernel to work a little bit better.
Therefore, I assume DAMON_RECLAIM users wouldn't want complex tuning, but might
have a few exceptional requests.  So the denylist would have only a few items
in it and hence would not so difficult to be used.  For them, asking the opt-in
list might be some additional works that they don't really want.

In contrast, the situation would be different for users who knows their
workloads well and willing to do specialized tuning.  For them, the
re-implementation of DAMON_RECLAIM in the way you suggested would make more
sense, and almost already available (making DAMON works against only unmapped
memory is currently not supported).  Actually, such user space-driven
specialized DAMON-based policies implementations are encouraged for such users.
If in-kernel DAMON-based policies like DAMON_RECLAIM or DAMON-based LRU
(de)activation are only bothering them, it would be better to simply turn off
those and implement alternatives for their situation.

As mentioned above, I want DAMON to be helpful for both two groups.

> 
> > > > DAMON-based THP Coalesce/Split
> > > > ------------------------------
> > > > 
> > > > THP is know to significantly improve performance, but also increase memory
> > > > footprint[1].  We can minimize the memory overhead while preserving the
> > > > performance benefit by asking DAMON to provide MADV_HUGEPAGE-like hints for hot
> > > > memory regions of >= 2MiB size, and MADV_NOHUGEPAGE-like hints for cold memory
> > > > regions.  Our experimental user space policy implementation[2] of this idea
> > > > removes 76.15% of THP memory waste while preserving 51.25% of THP speedup in
> > > > total.
> > > > 
> > > 
> > > This is a very interesting area to explore, and turns out to be very 
> > > timely as well.  We'll soon be proposing the MADV_COLLAPSE support that we 
> > > discussed here[1] and was well received.
> > > 
> > > One thought here is that with DAMON we can create a scheme to apply a 
> > > DAMOS_COLLAPSE action on very hot memory in the monitoring region that 
> > > would simply call into the new MADV_COLLAPSE code to allow us to do a 
> > > synchronous collapse in process context.  With the current DAMON support, 
> > > this seems very straight-forward once we have MADV_COLLAPSE.
> > > 
> > > [1] https://lore.kernel.org/all/d098c392-273a-36a4-1a29-59731cdf5d3d@google.com/
> > 
> > I also agree the synchronous and speedy THP collapse/split will be helpful for
> > application-specific usage, and what you described above is almost same to what
> > I'm planning to do.  Looking forward to MADV_COLLAPSE patch!
> > 
> 
> Adding Zach O'Keefe <zokeefe@google.com> who should be sending this out 
> shortly.  We'll be interested in your code review.

Looking forward to the patch! :)

> 
> > BTW, I'm also interested in the system-wide long term usage of the policy; the
> > slow speed of khugepaged seems not a big problem for the case.  I also recently
> > started thinking it might be more simple and make more sense to do the
> > proactive works for only collapse or split instead of doing those together,
> > depending on the system's THP setup.
> > 
> > For example, if '/sys/kernel/mm/transparent_hugepage/enabled' is set as
> > 'always', we could simply find cold memory regions and mark those with
> > NOHUGEPAGE hints to reduce THP internal fragmentation caused memory bloat,
> > under memory pressure.  If the file is set as 'madvise', we could find hot
> > memory regions and mark those with HUGEPAGE hints to reduce TLB misses, while
> > free memory ratio of the system is big.
> > 
> 
> Ah, yes, this is a slightly different motivation.  Our use of 
> max_ptes_none == 0 fixes the memory bloat problem for us :)  With 
> MADV_COLLAPSE, however, this perhaps may be better handled by a userspace 
> collapser instead of khugepaged since we can inform userspace of job 
> priorities and those that can or cannot handle the memory bloat.  In other 
> words, we no longer need to be lockd into a single max_ptes_none value for 
> the entire system if we are to explore a userspace collapser.

That makes sense.  Thank you for the clarification.

> 
> > > 
> > > > [1] https://www.usenix.org/conference/osdi16/technical-sessions/presentation/kwon
> > > > [2] https://damonitor.github.io/doc/html/v34/vm/damon/eval.html
> > > > 
[...]
> > > > 
> > > > DAMON-based Proactive Compaction
> > > > --------------------------------
> > > > 
> > > > Compaction uses migration scanner to find migration source pages.  Hot pages
> > > > would be more likely to be unmovable compared to cold pages, so it would be
> > > > better to try migration of cold pages first.  DAMON could be used here.  That
> > > > is, proactively monitoring accesses via DAMON and start compaction so that the
> > > > migration scanner scan cold memory ranges first.  I should admit I'm not
> > > > familiar with compaction code and I have no PoC data for this but just the
> > > > groundless idea, though.
> > > > 
> > > 
> > > Is compaction enlightenment for DAMON a high priority at this point, or 
> > > would AutoNUMA be a more interesting candidate?
> > > 
> > > Today, AutoNUMA works with a sliding window setting page tables to have 
> > > PROT_NONE permissions so that we induce a page fault and can determine 
> > > which cpu is accessing potentially remote memory (task_numa_work()).  If 
> > > that's happening, we can migrate the memory to the home NUMA node so that 
> > > we can avoid those remote memory accesses and the increased latency that 
> > > it induces.
> > 
> > I might missing something from your point, but what I hope to achieve with this
> > is faster and more successful defragmentation, not reduction of remote-NUMA
> > accesses.  Applying DAMON for enlightening AutoNUMA is also an interesting
> > idea, though.
> > 
> 
> Yeah, sorry, I conflated your proactive compaction topic with AutoNUMA :/
> 
> I'm not sure that I fully understand the point about hot pages being more 
> likely to be unmovable.  There may be optimizations possible in migrating 
> cold pages first, but I don't believe hotness implies that a page becomes 
> fully unmovable as a result of its access frequency.

Agreed.  This is only in a brainstorming level without any data.

> 
> > > Idea: if we enlightened task_numa_work() to prioritize hot memory using 
> > > DAMON, it *seems* like this would be most effective rather than relying on 
> > > a sliding window.  We want to migrate memory that is frequently being 
> > > accessed to reduce the remote memory access latency, we only get a minimal 
> > > improvement (mostly only node balancing) for memory that is rarely 
> > > accessed.
> > > 
> > > I'm somewhat surprised this isn't one of the highest priorities, actually, 
> > > for being enlightened with DAMON support, so it feels like I'm missing 
> > > something obvious.
> > > 
> > > Let's also add Dave Hansen <dave.hansen@linux.intel.com> into the thread 
> > > for the above two sections (memory tiering and AutoNUMA) because I know 
> > > he's thought about both.
> > 
> > AutoNUMA would need to know not only how frequently the memory regions is
> > accessed, but also which CPUs are how frequently accessing the memory regions.
> > Currently, DAMON doesn't provide the CPU-related information.  I think DAMON
> > could be extended for the case, by using the page fault mechanism as its basic
> > access check primitive instead of Accessed bits.  It would doable as DAMON is
> > designed to support such extension, but would need some additional efforts.
> > 
> 
> Yeah, I meant that we keep the current mechanism that allows AutoNUMA to 
> determine its optimal node by setting ptes to have PROT_NONE and inducing 
> a page fault so that we can determine the cpu, and thereby its NUMA node, 
> that is accessing it.
> 
> The idea for DAMON enlightenment here is that we can do better than the 
> simple sliding window that AutoNUMA currently uses.  In other words, 
> prefer to set hot memory to have PROT_NONE so that we can optimize the 
> node placement of frequently accessed memory first rather than simply 
> iterating through memory as though it all has the same access frequency 
> setting PROT_NONE.
> 
> This would need some more complexities, though, since the same memory 
> might consistently be hot and then we've succeeded in doing nothing but 
> inducing non-stop page faults for very hot memory :)

Agreed, thank you for the clarification!  I think that makes sense, and it
would require some additional works as you also mentioned.  Nevertheless, I
believe it's doable.  And I think we might be able to control the page fault
overhead using some sampling techniques.  Also, we might be able to use not
only PROT_NONE, but with the Accessed bits for further monitoring overhead
reduction.


Thanks,
SJ

[...]

Re: [RFC PLAN] Some humble ideas for DAMON future works

[SeongJae Park]

Hello,


On Wed, 19 Jan 2022 13:31:10 +0000 SeongJae Park <sj@kernel.org> wrote:

> Hello,
> 
> 
> After the DAMON code is merged (kudos to the community for the great helps), a
> few people asked me about my plan for DAMON future works, and if DAMON will be
> somewhat usable for their use cases.  I indeed have some humble plans, though
> those are only in rough brainsorming level at the moment. so I'd like to share
> those here before going forward and start coding, so that I can get some
> feedback to fail fast.

After sharing the summary of 2022 DAMON developments[1], I started thinking the
DAMON development plans for 2023.  While doing that, I just remembered this
DAMON future plans mail that I wrote at the beginning of 2022.  Checking the
status of DAMON development based on the long term plan could be helpful for
setting 2023 plan, so I'm gonna do it.

> 
> User-space Policy or In-kernel Policy?  Both.
> =============================================
> 
[...]
> I'd like to help both.  For the reason, I made DAMON as an in-kernel mechanism
> for both user and kernel-space policies.  It provides highly tunable general
> user space interface to help the first party.  It also provides in-kernel
> policies which built on top of DAMON using its kernel-space API for specific
> common use cases with conservative default parameters that assumed to incur no
> regression but some extent of benefits in most cases, namely DAMON-based
> proactive reclamation.  I will continue pursuing the two ways.

In 2023, we made some more user-space policies friendly knobs via DAMON sysfs
interface, but also made some in-kernel policies including DAMON_LRU_SORT.  We
may continue developing DAMON for two kind of policies.

> 
> Imaginable DAMON-based Policies
> ===============================
> 
[...]
> 
> DAMON-based Proactive LRU-pages (de)Activation
> ----------------------------------------------
> 
> My idea for helping this situation is manipulating the orders of pages in LRU
> lists using DAMON-provided monitoring results.  That is, making DAMON
> proactively finds hot/cold memory regions and moves pages of the hot regions to
> the head of the active list, while moving pages of the cold regions to the tail
> of the inactive list.  This will help eventual reclamation under memory
> pressure to evict cold pages first, so incur less additional page faults.

We did make this[1].  On our test, it reduced 20% of memory pressure stall.  It
may have some more rooms of improvements, though.

[1] https://lwn.net/Articles/905370/

[...]
> 
> DAMON-based THP Coalesce/Split
> ------------------------------
> 
> THP is know to significantly improve performance, but also increase memory
> footprint[1].  We can minimize the memory overhead while preserving the
> performance benefit by asking DAMON to provide MADV_HUGEPAGE-like hints for hot
> memory regions of >= 2MiB size, and MADV_NOHUGEPAGE-like hints for cold memory
> regions.  Our experimental user space policy implementation[2] of this idea
> removes 76.15% of THP memory waste while preserving 51.25% of THP speedup in
> total.
> 
> [1] https://www.usenix.org/conference/osdi16/technical-sessions/presentation/kwon
> [2] https://damonitor.github.io/doc/html/v34/vm/damon/eval.html

We didn't make this in 2022, mainly due to lack of time.  This would still be
in the TODO list.

> 
> DAMON-based Tiered Memory (Pro|De)motion
> ----------------------------------------
> 
> In tiered memory systems utilizing DRAM and PMEM[1], we can promote hot pages to
> DRAM and demote cold pages to PMEM using DAMON.  A patch for allowing
> access-aware demotion user space policy development is already submitted[2] by
> Baolin.
> 
> [1] https://www.intel.com/content/www/us/en/products/details/memory-storage/optane-memory.html
> [2] https://lore.kernel.org/linux-mm/cover.1640171137.git.baolin.wang@linux.alibaba.com/

We didn't make this in 2022, mainly due to lack of time.  This would still be
in the TODO list.

> 
> DAMON-based Proactive Compaction
> --------------------------------
> 
> Compaction uses migration scanner to find migration source pages.  Hot pages
> would be more likely to be unmovable compared to cold pages, so it would be
> better to try migration of cold pages first.  DAMON could be used here.  That
> is, proactively monitoring accesses via DAMON and start compaction so that the
> migration scanner scan cold memory ranges first.  I should admit I'm not
> familiar with compaction code and I have no PoC data for this but just the
> groundless idea, though.

We didn't make this in 2022, mainly due to lack of time.  This would still be
in the TODO list.

[...]
> 
> How DAMON Should Be Evolved For Supporting Those
> ================================================
> 
> Let's discuss what kind of changes in DAMON will be needed to efficiently
> support above mentioned policies.
> 
> Simultaneously Monitoring Different Types of Address Spaces
> -----------------------------------------------------------
> 
> It would be better to run all the above mentioned policies simultaneously on
> single system.  As some policies such as LRU-pages (de)activation would better
> to run on physical address space while some policies such as THP coalesce/split
> would need to run on virtual address spaces, DAMON should support concurrently
> monitoring different address spaces.  We can always do this by creating one
> DAMON context for each address space and running those.  However, as the
> address spaces will conflict, each other will be interfered.  Current idea for
> avoiding this is allowing multiple DAMON contexts to run on a single thread,
> forcing them to have same monitoring contexts.

We didn't make this in 2022, mainly due to lack of time.  This would still be
in the TODO list.

> 
> Online Parameters Updates
> -------------------------
> 
> Someone would also want to dynamically turn on/off and/or tune each policy.
> This is impossible with current DAMON, because it prohibits updating any
> parameter while it is running.  We disallow the online parameters update
> mainly because we want to avoid doing additional synchronization between the
> running kdamond and the parameters updater.  The idea for supporting the use
> case while avoiding the additional synchronization is, allowing users to pause
> DAMON and update parameters while it is paused.

We did make this in 2022.  DAMON sysfs interface, DAMON_RECLAIM, and
DAMON_LRU_SORT support online tuning.

> 
> A Better DAMON interface
> ------------------------
> 
> DAMON is currently exposing its major functionality to the user space via the
> debugfs.  After all, DAMON is not for only debugging.  Also, this makes the
> interface depends on debugfs unnecessarily, and considered unreliable.  Also,
> the interface is quite unflexible for future interface extension.  I admit it
> was not a good choice.
> 
> It would be better to implement another reliable and easily extensible
> interface, and deprecate the debugfs interface.  The idea is exposing the
> interface via sysfs using hierarchical Kobjects under mm_kobject.  For example,
> the usage would be something like below:
> 
>     # cd /sys/kernel/mm/damon
>     # echo 1 > nr_kdamonds
>     # echo 1 > kdamond_1/contexts/nr_contexts
>     # echo va > kdamond_1/contexts/context_1/target_type
>     # echo 1 > kdamond_1/contexts/context_1/targets/nr_targets
>     # echo $(pidof <workload>) > \
>                     kdamond_1/contexts/context_1/targets/target_1/pid
>     # echo Y > monitor_on

We did make this in 2022.  It makes extension of DAMON features easy.

> 
> More DAMON Future Works
> =======================
> 
> In addition to above mentioned things, there are many works to do.  It would be
> better to extend DAMON for more use cases and address spaces support, including
> page granularity, idleness only, read/write only, page cache only, and cgroups
> monitoring supports.

We didn't make this in 2022, mainly due to lack of time.  This would still be
in the TODO list.

Nevertheless, DAMOS filters feature could be used for effective support of
cgroups-based access-aware memory management.

One interesting idea for cgroups and page granularity monitoring, which I
shared during Kernel Summit'22 is using LRU-lists as a source of access
information.  Need more time for designing, though.

> 
> Also it would be valuable to improve the accuracy of monitoring, using some
> adaptive monitoring attributes tuning or some new fancy idea[1].

We didn't make this in 2022, mainly due to lack of time.  This would still be
in the TODO list.

> 
> DAMOS could also be improved by utilizing its own autotuning feature, for
> example, by monitoring PSI and other metrics related to the given action.

Transparent Memory Offloading, which was presented at ASPLOS'22 just after this
posting, made me sure again the importance of adaptive auto tuning.

We didn't make this in 2022, mainly due to lack of time.  This would still be
in the TODO list.  I'm personally trying to make this a prioritized task of
2023.

So, some of the TODO tasks are done, and still we have many more interesting
ideas to implement.  There will be some more new tasks, too.  I'm gonna think
about it more and may share some revised future plans soon.  If you want to
get the early version of the plan, or discuss and participate in the future
planning, please feel free to post question or inputs via mailing list
(damon@lists.linux.dev) or DAMON Beer/Coffee/Tea Chat series[1].  DAMON is
planned, prioritized and developed by the community's real needs.

[1] https://lore.kernel.org/damon/20220810225102.124459-1-sj@kernel.org/


Thanks,
SJ

[...]

Re: [RFC PLAN] Some humble ideas for DAMON future works

[SeongJae Park]

Hello,


On Wed, 19 Jan 2022 13:31:10 +0000 SeongJae Park <sj@kernel.org> wrote:

> Hello,
> 
> 
> After the DAMON code is merged (kudos to the community for the great helps), a
> few people asked me about my plan for DAMON future works, and if DAMON will be
> somewhat usable for their use cases.  I indeed have some humble plans, though
> those are only in rough brainsorming level at the moment. so I'd like to share
> those here before going forward and start coding, so that I can get some
> feedback to fail fast.

After sharing the summary of 2022 DAMON developments[1], I started thinking the
DAMON development plans for 2023.  While doing that, I just remembered this
DAMON future plans mail that I wrote at the beginning of 2022.  Checking the
status of DAMON development based on the long term plan could be helpful for
setting 2023 plan, so I'm gonna do it.

> 
> User-space Policy or In-kernel Policy?  Both.
> =============================================
> 
[...]
> I'd like to help both.  For the reason, I made DAMON as an in-kernel mechanism
> for both user and kernel-space policies.  It provides highly tunable general
> user space interface to help the first party.  It also provides in-kernel
> policies which built on top of DAMON using its kernel-space API for specific
> common use cases with conservative default parameters that assumed to incur no
> regression but some extent of benefits in most cases, namely DAMON-based
> proactive reclamation.  I will continue pursuing the two ways.

In 2023, we made some more user-space policies friendly knobs via DAMON sysfs
interface, but also made some in-kernel policies including DAMON_LRU_SORT.  We
may continue developing DAMON for two kind of policies.

> 
> Imaginable DAMON-based Policies
> ===============================
> 
[...]
> 
> DAMON-based Proactive LRU-pages (de)Activation
> ----------------------------------------------
> 
> My idea for helping this situation is manipulating the orders of pages in LRU
> lists using DAMON-provided monitoring results.  That is, making DAMON
> proactively finds hot/cold memory regions and moves pages of the hot regions to
> the head of the active list, while moving pages of the cold regions to the tail
> of the inactive list.  This will help eventual reclamation under memory
> pressure to evict cold pages first, so incur less additional page faults.

We did make this[1].  On our test, it reduced 20% of memory pressure stall.  It
may have some more rooms of improvements, though.

[1] https://lwn.net/Articles/905370/

[...]
> 
> DAMON-based THP Coalesce/Split
> ------------------------------
> 
> THP is know to significantly improve performance, but also increase memory
> footprint[1].  We can minimize the memory overhead while preserving the
> performance benefit by asking DAMON to provide MADV_HUGEPAGE-like hints for hot
> memory regions of >= 2MiB size, and MADV_NOHUGEPAGE-like hints for cold memory
> regions.  Our experimental user space policy implementation[2] of this idea
> removes 76.15% of THP memory waste while preserving 51.25% of THP speedup in
> total.
> 
> [1] https://www.usenix.org/conference/osdi16/technical-sessions/presentation/kwon
> [2] https://damonitor.github.io/doc/html/v34/vm/damon/eval.html

We didn't make this in 2022, mainly due to lack of time.  This would still be
in the TODO list.

> 
> DAMON-based Tiered Memory (Pro|De)motion
> ----------------------------------------
> 
> In tiered memory systems utilizing DRAM and PMEM[1], we can promote hot pages to
> DRAM and demote cold pages to PMEM using DAMON.  A patch for allowing
> access-aware demotion user space policy development is already submitted[2] by
> Baolin.
> 
> [1] https://www.intel.com/content/www/us/en/products/details/memory-storage/optane-memory.html
> [2] https://lore.kernel.org/linux-mm/cover.1640171137.git.baolin.wang@linux.alibaba.com/

We didn't make this in 2022, mainly due to lack of time.  This would still be
in the TODO list.

> 
> DAMON-based Proactive Compaction
> --------------------------------
> 
> Compaction uses migration scanner to find migration source pages.  Hot pages
> would be more likely to be unmovable compared to cold pages, so it would be
> better to try migration of cold pages first.  DAMON could be used here.  That
> is, proactively monitoring accesses via DAMON and start compaction so that the
> migration scanner scan cold memory ranges first.  I should admit I'm not
> familiar with compaction code and I have no PoC data for this but just the
> groundless idea, though.

We didn't make this in 2022, mainly due to lack of time.  This would still be
in the TODO list.

[...]
> 
> How DAMON Should Be Evolved For Supporting Those
> ================================================
> 
> Let's discuss what kind of changes in DAMON will be needed to efficiently
> support above mentioned policies.
> 
> Simultaneously Monitoring Different Types of Address Spaces
> -----------------------------------------------------------
> 
> It would be better to run all the above mentioned policies simultaneously on
> single system.  As some policies such as LRU-pages (de)activation would better
> to run on physical address space while some policies such as THP coalesce/split
> would need to run on virtual address spaces, DAMON should support concurrently
> monitoring different address spaces.  We can always do this by creating one
> DAMON context for each address space and running those.  However, as the
> address spaces will conflict, each other will be interfered.  Current idea for
> avoiding this is allowing multiple DAMON contexts to run on a single thread,
> forcing them to have same monitoring contexts.

We didn't make this in 2022, mainly due to lack of time.  This would still be
in the TODO list.

> 
> Online Parameters Updates
> -------------------------
> 
> Someone would also want to dynamically turn on/off and/or tune each policy.
> This is impossible with current DAMON, because it prohibits updating any
> parameter while it is running.  We disallow the online parameters update
> mainly because we want to avoid doing additional synchronization between the
> running kdamond and the parameters updater.  The idea for supporting the use
> case while avoiding the additional synchronization is, allowing users to pause
> DAMON and update parameters while it is paused.

We did make this in 2022.  DAMON sysfs interface, DAMON_RECLAIM, and
DAMON_LRU_SORT support online tuning.

> 
> A Better DAMON interface
> ------------------------
> 
> DAMON is currently exposing its major functionality to the user space via the
> debugfs.  After all, DAMON is not for only debugging.  Also, this makes the
> interface depends on debugfs unnecessarily, and considered unreliable.  Also,
> the interface is quite unflexible for future interface extension.  I admit it
> was not a good choice.
> 
> It would be better to implement another reliable and easily extensible
> interface, and deprecate the debugfs interface.  The idea is exposing the
> interface via sysfs using hierarchical Kobjects under mm_kobject.  For example,
> the usage would be something like below:
> 
>     # cd /sys/kernel/mm/damon
>     # echo 1 > nr_kdamonds
>     # echo 1 > kdamond_1/contexts/nr_contexts
>     # echo va > kdamond_1/contexts/context_1/target_type
>     # echo 1 > kdamond_1/contexts/context_1/targets/nr_targets
>     # echo $(pidof <workload>) > \
>                     kdamond_1/contexts/context_1/targets/target_1/pid
>     # echo Y > monitor_on

We did make this in 2022.  It makes extension of DAMON features easy.

> 
> More DAMON Future Works
> =======================
> 
> In addition to above mentioned things, there are many works to do.  It would be
> better to extend DAMON for more use cases and address spaces support, including
> page granularity, idleness only, read/write only, page cache only, and cgroups
> monitoring supports.

We didn't make this in 2022, mainly due to lack of time.  This would still be
in the TODO list.

Nevertheless, DAMOS filters feature could be used for effective support of
cgroups-based access-aware memory management.

One interesting idea for cgroups and page granularity monitoring, which I
shared during Kernel Summit'22 is using LRU-lists as a source of access
information.  Need more time for designing, though.

> 
> Also it would be valuable to improve the accuracy of monitoring, using some
> adaptive monitoring attributes tuning or some new fancy idea[1].

We didn't make this in 2022, mainly due to lack of time.  This would still be
in the TODO list.

> 
> DAMOS could also be improved by utilizing its own autotuning feature, for
> example, by monitoring PSI and other metrics related to the given action.

Transparent Memory Offloading, which was presented at ASPLOS'22 just after this
posting, made me sure again the importance of adaptive auto tuning.

We didn't make this in 2022, mainly due to lack of time.  This would still be
in the TODO list.  I'm personally trying to make this a prioritized task of
2023.

So, some of the TODO tasks are done, and still we have many more interesting
ideas to implement.  There will be some more new tasks, too.  I'm gonna think
about it more and may share some revised future plans soon.  If you want to
get the early version of the plan, or discuss and participate in the future
planning, please feel free to post question or inputs via mailing list
(damon@lists.linux.dev) or DAMON Beer/Coffee/Tea Chat series[1].  DAMON is
planned, prioritized and developed by the community's real needs.

[1] https://lore.kernel.org/damon/20220810225102.124459-1-sj@kernel.org/


Thanks,
SJ

[...]