mirror of https://lore.kernel.org/lkml/
 help / color / mirror / Atom feed
From: Chen Yu <chen.yu@linux.dev>
To: Tim Chen <tim.c.chen@linux.intel.com>, Jirka Hladky <jhladky@redhat.com>
Cc: Jirka Hladky <jhladky@redhat.com>,
	Peter Zijlstra <peterz@infradead.org>,
	"Chen, Yu C" <yu.c.chen@intel.com>,
	Ingo Molnar <mingo@redhat.com>,
	K Prateek Nayak <kprateek.nayak@amd.com>,
	"Gautham R . Shenoy" <gautham.shenoy@amd.com>,
	Vincent Guittot <vincent.guittot@linaro.org>,
	Juri Lelli <juri.lelli@redhat.com>,
	Dietmar Eggemann <dietmar.eggemann@arm.com>,
	Steven Rostedt <rostedt@goodmis.org>,
	Ben Segall <bsegall@google.com>, Mel Gorman <mgorman@suse.de>,
	Valentin Schneider <vschneid@redhat.com>,
	Madadi Vineeth Reddy <vineethr@linux.ibm.com>,
	Hillf Danton <hdanton@sina.com>,
	Shrikanth Hegde <sshegde@linux.ibm.com>,
	Jianyong Wu <jianyong.wu@outlook.com>,
	Yangyu Chen <cyy@cyyself.name>,
	Tingyin Duan <tingyin.duan@gmail.com>,
	Vern Hao <vernhao@tencent.com>, Vern Hao <haoxing990@gmail.com>,
	Len Brown <len.brown@intel.com>, Aubrey Li <aubrey.li@intel.com>,
	Zhao Liu <zhao1.liu@intel.com>, Chen Yu <yu.chen.surf@gmail.com>,
	Adam Li <adamli@os.amperecomputing.com>,
	Aaron Lu <ziqianlu@bytedance.com>,
	Tim Chen <tim.c.chen@intel.com>, Josh Don <joshdon@google.com>,
	Gavin Guo <gavinguo@igalia.com>,
	Qais Yousef <qyousef@layalina.io>,
	Libo Chen <libchen@purestorage.com>,
	linux-kernel@vger.kernel.org, "Luck, Tony" <tony.luck@intel.com>,
	Reinette Chatre <reinette.chatre@intel.com>,
	Philip Auld <pauld@redhat.com>, Joe Mario <jmario@redhat.com>
Subject: Re: [Patch v4 17/22] sched/cache: Avoid cache-aware scheduling for memory-heavy processes
Date: Mon, 16 Nov 2026 13:46:17 +0800	[thread overview]
Message-ID: <avqYbuJPHo4zLDOd@three-body> (raw)
In-Reply-To: <13d982ce42116f876f01a77bae7f02d3800f08fc.camel@linux.intel.com>

Hi Jirka, Tim,

On Fri, Nov 13, 2026 at 03:06:58PM -0800, Tim Chen wrote:
> On Fri, 2026-11-13 at 17:29 +0100, Jirka Hladky wrote:
> > Hi Peter, Chen Yu, Tim,
> > 
> > 
> > 
> 
> [snip]
> 
> > THE FOOTPRINT ESTIMATE NEVER LEAVES ZERO (MG class D, 64 threads)
> >   Traced live on the stock kernel with bpftrace (comm-filtered),
> >   across three CAS-on runs:
> > 
> >     - grp->footprint: 0 in 44,670 and 40,638 task_cache_work()
> >       samples over two full runs (min = max = 0), while ~7M pages
> >       (26.4 GiB) were resident. NUMA balancing was active: 8k-20k
> >       hint faults and up to 3.3M pages migrated per run.
> >     - In those two runs the footprint write never executed: all
> >       ~8k-13k task_numa_placement() calls per run (one per hint
> >       fault, via task_numa_fault()) returned at the scan_seq gate.
> > 
> >   WHY THE SIGNAL NEVER ACCUMULATES
> >   1. grp->footprint is only written in task_numa_placement(),
> >      which runs only when mm->numa_scan_seq changes. That counter
> >      increments only in reset_ptenuma_scan(): when the NUMA scanner
> >      has wrapped the whole address space.
> >   2. The scanner walks the 26.4 GiB of mappings at ~0.3-1 GiB/s
> >      (traced via mm->numa_scan_offset and change_prot_numa()
> >      return values), so one sweep takes 30-40s or more. The 43s
> >      benchmark completed 0 sweeps in two runs, 1 sweep (at t=33s)
> >      in a third. The accounting runs at most once per task per
> >      run.
> >   3. The signal is also small: a run accumulates only 8k-20k
> >      hint-fault events, 0.1-0.3% of the working set, below the
> >      108 MiB threshold even when a sweep does complete.
> >   4. And it is a rate signal, not a size: the increment is
> >      diff = numa_faults[MEMBUF] - numa_faults[MEM] / 2, which is
> >      zero at any steady fault rate.
> > 
> >   Cadence, coverage and formula each independently hold the
> >   footprint orders of magnitude below the resident set.
> > 
> >   exceed_llc_capacity() is evaluated on every tick and every scan
> >   epoch, but with footprint at 0 the comparison
> > 
> >       llc_bytes * scale  <  footprint * PAGE_SIZE
> > 
> >   is never true, so grp->cpu is never reset. After a 1.8s warm-up it
> >   pointed at the same LLC for all 44,661 remaining samples.
> > 
> >   Without NUMA balancing the check never triggers, as sched-cache.rst
> >   documents. With CAS on and numa_balancing=0 the same run takes
> >   42.2s, the same as with NUMA balancing on (42.0s).
> > 
> > WHAT THE AGGREGATION COSTS (MG class D, 64 threads)
> >   - With CAS on, 97% of thread-samples are on one node. The 26.4 GiB
> >     working set starts ~50/50 across the nodes and NUMA balancing
> >     then pulls it to the busy node (numa_maps 3.3M/2.7M pages ->
> >     6.7M/0.2M; 1.42M pages migrated during the run).
> >   - The cost is not on the CPU side: average CPU utilization is
> >     essentially unchanged (6164% vs 6029% - about 61 of the 64
> >     threads on-CPU in both configurations), and wakeup latency is
> >     49us on average, 0.73ms max (perf sched). What grows is
> >     UserTime, +48%: the threads keep running, each operation just
> >     stalls longer on memory.
> >   - The cost is the placement itself, not migration or remote
> >     accesses:
> >       a) 32 threads: memory fully converges to the busy node well
> >          before the run ends, and the run is still 46% slower;
> >       b) CAS on with numa_balancing=0: no migrations, pages stay
> >          65/35, and the runtime is unchanged (42.2s);
> >       c) CAS off with the process simply taskset-pinned to one
> >          socket (memory 100% local from first touch, no
> >          migrations): 40.3s, within the CAS-on range (40.6-42.9s).
> >     64 memory-streaming threads on one socket get about two thirds
> >     of the throughput they get spread across both sockets (Mop/s
> >     -34%), wherever the pages live. So the only effective fix is to
> >     not aggregate such a process in the first place.
> > 
> 
> Thanks for your detailed analysis of the regression on NAS MG
> and its root cause. Much appreciated.
> 
> > QUESTIONS
> >   1. Was the sweep-boundary gating of this accounting known or
> >      intended? For a workload with a large address space it means
> >      the footprint sees at most one update per run; for a shorter
> >      one, none at all.
> 
> Not intended. Your reading of the code is right. The footprint is
> only written from task_numa_placement(), and that function returns
> early unless mm->numa_scan_seq has moved, which happens once per full
> sweep of the address space. The cadence is fine for NUMA placement.
> But it may be too long for large footprints. The tests we
> validated against had a small enough RSS that the first sweep finished
> within the first seconds of the run.
> 
> One correction to your point 3. numa_faults counts pages, not fault
> events. A THP hint fault adds HPAGE_PMD_NR (512) pages per fault. Your
> 3.3M migrated pages from 8k-20k faults suggests THP was in use. If so,
> one completed sweep would push the footprint to millions of pages, far
> above the 27.6k pages that equal a 108 MiB LLC. Two things would help
> confirm this:
> 
>   - Was THP enabled for the MG run?
>   - In the third run, did grp->footprint become non-zero after the
>     sweep completed at t=33s?
> 
> If both are yes, then sweep cadence is the problem and the size
> estimate is not.
> 
> >   2. Could the check fail closed when there is no usable estimate
> >      (warm-up, footprint still 0, NUMA balancing off)? RSS is a poor
> >      estimate of the working set, as Peter said, but it is an upper
> >      bound: if RSS fits in the LLC, so does the working set. Using it
> >      only on the permit side - aggregate without a footprint estimate
> >      only if RSS fits - would keep the gains for small processes and
> >      not aggregate the ones we cannot judge. The costs are
> >      asymmetric: a missed aggregation forfeits a gain, a wrong one
> >      cost 65% here.
> 
> I think you have a point. I see two ways to fix this issue,
> and they are complementary.
> 
> Fix 1:
> 
>   - When footprint is 0, or NUMA balancing is off, compare the RSS of
>     the mm against llc_bytes * scale. Aggregate only if RSS fits.
>   - Once a footprint estimate exists, use it as today.
> 
> RSS is not used as the estimate here, only as an upper bound while
> there is no footprint from the sweep. That is consistent with Peter's
> objection in April. It also closes the NUMA-balancing-off gap that
> sched-cache.rst documents.
> 
> The downside: a process with a large RSS but a small hot set will not
> be aggregated until an estimate exists, and with a very large RSS that
> can be the whole run. A process that runs for less than one sweep
> never gets an estimate at all.
>

In the original patch that leverages RSS[1], it uses the per-mm RSS:
get_mm_counter(mm, MM_ANONPAGES) + get_mm_counter(mm, MM_SHMEMPAGES). In,
the future we do not want cache-aware scheduling to be tied to mm_struct,
it will be turned into per-sched_cache_group, and we might need to support
per-sched_cache_group RSS.
 
> Fix 2:
> 
> On the cadence side: accumulate the pages reported by
> task_numa_fault() into the footprint as they arrive within the
> current sweep, instead of waiting for task_numa_placement().

Do you mean accumulate the pages into the group in task_numa_fault()? As we are trying
to convert the footprint into atomic[2], this might increase the overhead since multiple
threads write this counter in parallel. A workaround is to accumulate the pages every N
pages into the group to mitigate the overhead.

> The footprint then grows during the first sweep and the check trips
> quickly for your MG run. At the sweep boundary task_numa_placement()
> only applies the decay of the previous window,

Would this decay cause a jitter of the footprint? Anyway, I thought what you suggested is the
following for fix2(although this version racy with concurrent updates from other threads sharing this
mm). BTW, with this mechanism, I don't think we need to subtract the footprint during
exit() or exec(), because the footprint will decay gradually?

[1] https://lore.kernel.org/all/339bb2636c7306e17540268a9295a8e673b92804.1775065312.git.tim.c.chen@linux.intel.com/
[2] https://lore.kernel.org/all/20261022031933.46869-1-jemmywong512@gmail.com/

thanks,
Chenyu

diff --git a/include/linux/sched.h b/include/linux/sched.h
index e4f6323d7855..c3cda7b51e66 100644
--- a/include/linux/sched.h
+++ b/include/linux/sched.h
@@ -1444,6 +1444,7 @@ struct task_struct {
 	int				preferred_llc;
 	/* 1: task was enqueued to its preferred LLC, 0 otherwise */
 	int				pref_llc_queued;
+	unsigned long			total_footprint;
 #endif
 
 	struct rseq_data		rseq;
diff --git a/init/init_task.c b/init/init_task.c
index ce7c2b07d855..24bac99dab8a 100644
--- a/init/init_task.c
+++ b/init/init_task.c
@@ -231,6 +231,7 @@ struct task_struct init_task __aligned(L1_CACHE_BYTES) = {
 #ifdef CONFIG_SCHED_CACHE
 	.preferred_llc  = -1,
 	.pref_llc_queued  = 0,
+	.total_footprint = 0;
 #endif
 #if defined(CONFIG_KASAN_GENERIC) || defined(CONFIG_KASAN_SW_TAGS)
 	.kasan_depth	= 1,
diff --git a/kernel/sched/fair.c b/kernel/sched/fair.c
index 79f6b3a4fd7f..470ba0dc6719 100644
--- a/kernel/sched/fair.c
+++ b/kernel/sched/fair.c
@@ -1730,19 +1730,6 @@ void sched_cache_exit_mm(struct task_struct *p)
 {
 	struct sched_cache_group *grp = sched_cache_replace_grp(p, NULL);
 
-#ifdef CONFIG_NUMA_BALANCING
-	/*
-	 * Subtract this task's footprint from the group before dropping the
-	 * reference, so the group footprint converges as its threads exit.
-	 * Unlocked for performance; clamp to avoid underflow.
-	 */
-	if (grp && p->total_numa_faults) {
-		unsigned long fp = READ_ONCE(grp->footprint);
-		unsigned long sub = min(fp, p->total_numa_faults);
-
-		WRITE_ONCE(grp->footprint, fp - sub);
-	}
-#endif
 	sched_cache_group_put(grp);
 }
 
@@ -2125,6 +2112,7 @@ void init_sched_mm(struct task_struct *p)
 	 */
 	p->preferred_llc = -1;
 	p->pref_llc_queued = 0;
+	p->total_footprint = 0;
 }
 
 #else /* CONFIG_SCHED_CACHE */
@@ -3826,6 +3814,43 @@ static int preferred_group_nid(struct task_struct *p, int nid)
 	return nid;
 }
 
+#ifdef CONFIG_SCHED_CACHE
+
+#define SCHED_CACHE_FP_THRESHOLD 10
+static void sched_cache_footprint_accum(struct task_struct *p, int pages)
+{
+	p->total_footprint += pages;
+
+	if (p->total_footprint < SCHED_CACHE_FP_THRESHOLD)
+		return;
+
+	guard(rcu);
+	grp = rcu_dereference(p->sched_cache_grp);
+
+	if (!grp)
+		return;
+
+	/*drain the per task footprint into group */
+	WRITE_ONCE(grp->footprint, (long)READ_ONCE(grp->footprint) + p->total_footprint);
+	p->total_footprint = 0;
+}
+
+static void sched_cache_footprint_decay(struct task_struct *p)
+{
+	WRITE_ONCE(grp->footprint, (long)READ_ONCE(grp->footprint) / 2);
+}
+
+#else
+static void sched_cache_footprint_accum(struct task_struct *p, int pages)
+{
+}
+
+static void sched_cache_footprint_decay(struct task_struct *p)
+{
+}
+
+#endif
+
 static void task_numa_placement(struct task_struct *p)
 	__context_unsafe(/* conditional locking */)
 {
@@ -3911,36 +3936,6 @@ static void task_numa_placement(struct task_struct *p)
 				ng->total_faults += diff;
 				group_faults += ng->faults[mem_idx];
 			}
-#ifdef CONFIG_SCHED_CACHE
-			/*
-			 * Per task p->numa_faults[mem_idx] converges,
-			 * so the accumulation of each task's faults
-			 * converges too - Given the number of threads,
-			 * it cannot overflow an unsigned long.
-			 * Racy with concurrent updates from other threads
-			 * sharing this mm. Acceptable since footprint is a
-			 * heuristic and occasional lost updates are tolerable.
-			 *
-			 * If a task exits, its corresponding footprint must
-			 * be subtracted from p->sched_cache_grp->footprint,
-			 * otherwise the footprint will not converge: the
-			 * exiting thread's footprint remains unchanged/undecayed.
-			 * See exit_mm().
-			 *
-			 * Lost updates and unsynchronized subtraction
-			 * in exit_mm() can cause footprint + diff to
-			 * go negative. Clamp to zero to prevent the
-			 * unsigned footprint from wrapping.
-			 */
-			scoped_guard(rcu) {
-				grp = rcu_dereference(p->sched_cache_grp);
-
-				if (grp) {
-					new_fp = (long)READ_ONCE(grp->footprint) + diff;
-					WRITE_ONCE(grp->footprint, max(new_fp, 0L));
-				}
-			}
-#endif
 		}
 
 		if (!ng) {
@@ -3970,6 +3965,7 @@ static void task_numa_placement(struct task_struct *p)
 	}
 
 	update_task_scan_period(p, fault_types[0], fault_types[1]);
+	sched_cache_footprint_decay(p);
 }
 
 static inline int get_numa_group(struct numa_group *grp)
@@ -4210,6 +4206,7 @@ void task_numa_fault(int last_cpupid, int mem_node, int pages, int flags)
 	p->numa_faults[task_faults_idx(NUMA_MEMBUF, mem_node, priv)] += pages;
 	p->numa_faults[task_faults_idx(NUMA_CPUBUF, cpu_node, priv)] += pages;
 	p->numa_faults_locality[local] += pages;
+	sched_cache_footprint_accum(p, pages);
 }
 
 static void reset_ptenuma_scan(struct task_struct *p)
-- 
2.43.0
> so the steady state
> value is unchanged.
> 
> The downside: for a workload like yours there is still a short window
> where we aggregate before the footprint crosses the LLC size. With
> THP each hint fault adds 512 pages, so the 27.6k pages of a 108 MiB
> LLC are reached after about 54 faults. At the few hundred faults per
> second you measured that is under a second once scanning starts, and
> scanning starts after the 1s scan delay. That is about the 1.8s
> warm-up you saw before grp->cpu settled.
> 
> Fix 2 depends on NUMA balancing. Fix 1 also covers
> your numa_balancing=0 run.
> 
> I lean toward doing both: Fix 2 for the cadence, Fix 1 for NUMA
> balancing off and for the first sweep. Peter, is the RSS bound
> acceptable when it is used only as a gate and never as the estimate?
> 
>
> >   3. Our data supports Peter's point that LLC hit/miss information
> >      would be the better signal: the damage is purely memory-side
> >      (UserTime +59% at flat CPU% in the 112-thread run), and a
> >      memory-streaming process would show a low hit rate regardless
> >      of how well its footprint is estimated. Is anyone looking at
> >      that?
> 
> I am not aware of patches posted along these lines. 
> 
> The two possible routes are RDT (CMT llc_occupancy and MBM bandwidth per RMID)
> and PMU miss counters. RDT needs an RMID per cache group, which
> resctrl owns.  Mixing RMID management with scheduler will be tricky.
> 
> The scheduler does not own the PMU, so the PMU route is
> unlikely to be accepted. Near term the usable signals are the RSS
> bound above and user hints through prctl to enable/disable
> cache aware scheduling or modify tuning knobs per sched group.
> 
> 
> >   4. Chen Yu mentioned that you are reworking the footprint
> >      accounting for the prctl v2 series [2]. Could the detection fix
> >      be part of that rework?
> > 
> 
> The v2 work on footprint is about correctness, not cadence. 
> 
> Fix 2 I mentioned above touches the same footprint code that the 
> v2 series reworks, so the two are not independent. I think we
> would consider whether to add the proposed fixes in the same
> series or leave it as a follow on.
> 
> Would you consider testing the patches when we post them?
> We will CC you.
> 
> Tim
> 
> > [1] <50a8055e38958cdc39e07435aaad56e4719b2bd3.1794507151.git.tim.c.chen@linux.intel.com>
> > [2] <5c912bd3-8701-4395-a118-4ee6e09233e2@intel.com>
> > [3] NAS Parallel Benchmarks: https://www.nas.nasa.gov/software/npb.html
> >     MG is the multigrid kernel: four V-cycles of 27-point stencil
> >     sweeps over a 3D grid hierarchy (finest grid 512^3 for class C,
> >     1024^3 for class D) solving a Poisson equation. Each sweep
> >     streams through a few double-precision arrays - a 3.3 GiB working
> >     set for class C, 26.4 GiB for class D - far beyond any LLC, with
> >     little reuse between sweeps: the kernel is memory-bandwidth-bound
> >     by construction.
> > 
> > The per-run logs, the placement/migration/sweep traces, and the
> > bpftrace scripts behind them are available if useful.
> > 
> > Regards,
> > Jirka Hladky
> > Red Hat
> > 

  parent reply	other threads:[~2026-11-16  5:45 UTC|newest]

Thread overview: 76+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2026-04-01 21:52 [Patch v4 00/22] Cache aware scheduling Tim Chen
2026-04-01 21:52 ` [Patch v4 01/22] sched/cache: Introduce infrastructure for cache-aware load balancing Tim Chen
2026-04-09 12:41   ` Peter Zijlstra
2026-04-09 19:21     ` Tim Chen
2026-04-09 23:00       ` Peter Zijlstra
2026-04-10  6:30         ` Chen, Yu C
2026-04-15  2:06   ` Vern Hao
2026-04-15  3:34     ` Chen, Yu C
2026-09-14 17:50   ` Zenghui Yu
2026-09-14 23:12     ` Tim Chen
2026-09-18  7:14       ` Zenghui Yu
2026-04-01 21:52 ` [Patch v4 02/22] sched/cache: Limit the scan number of CPUs when calculating task occupancy Tim Chen
2026-04-09 13:17   ` Luo Gengkun
2026-04-09 13:41     ` Peter Zijlstra
2026-04-10 10:12       ` Luo Gengkun
2026-04-10  7:29     ` Chen, Yu C
2026-04-10 10:20       ` Luo Gengkun
2026-04-10 17:12       ` Tim Chen
2026-04-10 17:27         ` Chen, Yu C
2026-04-13  7:23           ` [RFC PATCH] sched/fair: dynamically scale the period of cache work Jianyong Wu
2026-04-13  8:38             ` Chen, Yu C
2026-04-13 11:27               ` Jianyong Wu
2026-04-15  3:31                 ` Chen, Yu C
2026-04-16  3:39                   ` Jianyong Wu
2026-04-15 17:22             ` Tim Chen
2026-04-16  6:50               ` Jianyong Wu
2026-04-14 15:07           ` [PATCH v2] sched/cache: Reduce the overhead of task_cache_work by only scan the visisted cpus Luo Gengkun
2026-04-15  3:10             ` Chen, Yu C
2026-04-18  9:01               ` Luo Gengkun
2026-04-20  7:53                 ` Chen, Yu C
2026-04-23  8:54                   ` [PATCH v3] " Luo Gengkun
2026-04-01 21:52 ` [Patch v4 03/22] sched/cache: Record per LLC utilization to guide cache aware scheduling decisions Tim Chen
2026-04-01 21:52 ` [Patch v4 04/22] sched/cache: Introduce helper functions to enforce LLC migration policy Tim Chen
2026-04-01 21:52 ` [Patch v4 05/22] sched/cache: Make LLC id continuous Tim Chen
2026-04-01 21:52 ` [Patch v4 06/22] sched/cache: Assign preferred LLC ID to processes Tim Chen
2026-04-01 21:52 ` [Patch v4 07/22] sched/cache: Track LLC-preferred tasks per runqueue Tim Chen
2026-04-01 21:52 ` [Patch v4 08/22] sched/cache: Introduce per CPU's tasks LLC preference counter Tim Chen
2026-04-01 21:52 ` [Patch v4 09/22] sched/cache: Calculate the percpu sd task LLC preference Tim Chen
2026-04-01 21:52 ` [Patch v4 10/22] sched/cache: Count tasks prefering destination LLC in a sched group Tim Chen
2026-04-01 21:52 ` [Patch v4 11/22] sched/cache: Check local_group only once in update_sg_lb_stats() Tim Chen
2026-04-01 21:52 ` [Patch v4 12/22] sched/cache: Prioritize tasks preferring destination LLC during balancing Tim Chen
2026-04-01 21:52 ` [Patch v4 13/22] sched/cache: Add migrate_llc_task migration type for cache-aware balancing Tim Chen
2026-04-01 21:52 ` [Patch v4 14/22] sched/cache: Handle moving single tasks to/from their preferred LLC Tim Chen
2026-04-01 21:52 ` [Patch v4 15/22] sched/cache: Respect LLC preference in task migration and detach Tim Chen
2026-04-01 21:52 ` [Patch v4 16/22] sched/cache: Disable cache aware scheduling for processes with high thread counts Tim Chen
2026-04-09 12:43   ` Peter Zijlstra
2026-04-09 19:27     ` Tim Chen
2026-04-01 21:52 ` [Patch v4 17/22] sched/cache: Avoid cache-aware scheduling for memory-heavy processes Tim Chen
2026-04-09 12:46   ` Peter Zijlstra
2026-04-09 12:55     ` Peter Zijlstra
2026-04-10  8:59     ` Chen, Yu C
2026-04-10  9:20       ` Peter Zijlstra
2026-11-13 16:29         ` Jirka Hladky
2026-11-13 23:06           ` Tim Chen
2026-11-14  0:55             ` Jirka Hladky
2026-11-16  5:46             ` Chen Yu [this message]
2026-04-01 21:52 ` [Patch v4 18/22] sched/cache: Enable cache aware scheduling for multi LLCs NUMA node Tim Chen
2026-04-09 13:37   ` Peter Zijlstra
2026-04-09 19:39     ` Tim Chen
2026-04-01 21:52 ` [Patch v4 19/22] sched/cache: Allow the user space to turn on and off cache aware scheduling Tim Chen
2026-04-01 21:52 ` [Patch v4 20/22] sched/cache: Add user control to adjust the aggressiveness of cache-aware scheduling Tim Chen
2026-04-01 21:52 ` [Patch v4 21/22] -- DO NOT APPLY!!! -- sched/cache/debug: Display the per LLC occupancy for each process via proc fs Tim Chen
2026-04-01 21:52 ` [Patch v4 22/22] -- DO NOT APPLY!!! -- sched/cache/debug: Add ftrace to track the load balance statistics Tim Chen
2026-04-09 13:54 ` [Patch v4 00/22] Cache aware scheduling Peter Zijlstra
2026-04-09 20:02   ` Tim Chen
2026-04-14  3:20 ` Duan Tingyin
2026-04-15 17:35   ` Tim Chen
2026-04-16  0:27 ` Qais Yousef
2026-04-20  9:01   ` Chen, Yu C
2026-04-21  0:34     ` Qais Yousef
2026-04-21 20:57       ` Tim Chen
2026-04-23 15:06         ` Qais Yousef
2026-04-23 16:48           ` Chen, Yu C
2026-04-25  0:05             ` Qais Yousef
2026-04-23 17:17       ` Chen, Yu C
2026-04-25  0:14         ` Qais Yousef

Reply instructions:

You may reply publicly to this message via plain-text email
using any one of the following methods:

* Save the following mbox file, import it into your mail client,
  and reply-to-all from there: mbox

  Avoid top-posting and favor interleaved quoting:
  https://en.wikipedia.org/wiki/Posting_style#Interleaved_style

* Reply using the --to, --cc, and --in-reply-to
  switches of git-send-email(1):

  git send-email \
    --in-reply-to=avqYbuJPHo4zLDOd@three-body \
    --to=chen.yu@linux.dev \
    --cc=adamli@os.amperecomputing.com \
    --cc=aubrey.li@intel.com \
    --cc=bsegall@google.com \
    --cc=cyy@cyyself.name \
    --cc=dietmar.eggemann@arm.com \
    --cc=gautham.shenoy@amd.com \
    --cc=gavinguo@igalia.com \
    --cc=haoxing990@gmail.com \
    --cc=hdanton@sina.com \
    --cc=jhladky@redhat.com \
    --cc=jianyong.wu@outlook.com \
    --cc=jmario@redhat.com \
    --cc=joshdon@google.com \
    --cc=juri.lelli@redhat.com \
    --cc=kprateek.nayak@amd.com \
    --cc=len.brown@intel.com \
    --cc=libchen@purestorage.com \
    --cc=linux-kernel@vger.kernel.org \
    --cc=mgorman@suse.de \
    --cc=mingo@redhat.com \
    --cc=pauld@redhat.com \
    --cc=peterz@infradead.org \
    --cc=qyousef@layalina.io \
    --cc=reinette.chatre@intel.com \
    --cc=rostedt@goodmis.org \
    --cc=sshegde@linux.ibm.com \
    --cc=tim.c.chen@intel.com \
    --cc=tim.c.chen@linux.intel.com \
    --cc=tingyin.duan@gmail.com \
    --cc=tony.luck@intel.com \
    --cc=vernhao@tencent.com \
    --cc=vincent.guittot@linaro.org \
    --cc=vineethr@linux.ibm.com \
    --cc=vschneid@redhat.com \
    --cc=yu.c.chen@intel.com \
    --cc=yu.chen.surf@gmail.com \
    --cc=zhao1.liu@intel.com \
    --cc=ziqianlu@bytedance.com \
    /path/to/YOUR_REPLY

  https://kernel.org/pub/software/scm/git/docs/git-send-email.html

* If your mail client supports setting the In-Reply-To header
  via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox

all inboxes | Powered by JetHome®