Re: [PATCH 04/19] sched, numa, mm: Describe the NUMA scheduling problem formally

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 



as per 4) move towards where "most" memory. If we have a large shared memory than private memnory. Why not we just move the process towrds the memory.. instead of the memory moving towards the node. This will i guess be less cumbersome, then moving all the shared memory

On Fri, Nov 16, 2012 at 9:55 PM, Ingo Molnar <mingo@xxxxxxxxxx> wrote:
+Since per 2b our 's_i,k' and 'p_i' require at least two scans to 'stabilize'
+and show representative numbers, we should limit node-migration to not be
+faster than this.


[Index of Archives]     [Linux ARM Kernel]     [Linux ARM]     [Linux Omap]     [Fedora ARM]     [IETF Annouce]     [Bugtraq]     [Linux]     [Linux OMAP]     [Linux MIPS]     [ECOS]     [Asterisk Internet PBX]     [Linux API]