| lists.openwall.net | lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC | |
|
Open Source and information security mailing list archives
| ||
|
Message-ID: <4A2E1C67.4040301@redhat.com> Date: Tue, 09 Jun 2009 11:25:11 +0300 From: Avi Kivity <avi@...hat.com> To: Kallol Biswas <nucleodyne@...il.com> CC: linux-kernel@...r.kernel.org Subject: Re: looking for ideas on VM related research projects Kallol Biswas wrote: > Hi, > I am from IO and driver background, and not up to date with > current VM developments in linux. > > Are you talking about NUMA architecture? Yes. > Could you clarify or point me > to document that describes the problem with VMA/task affinity? Linux will try to allocate memory on the same node that the allocating thread ran on on the time the page was faulted in. However, for long running processes, the thread will eventually migrate to some other cpu with only 1/N chance of actually running on the same node (N being the number of nodes). If we can specify that a thread is related to some vma, the scheduler can try to keep that thread running on the vma's node, or else it can migrate the vma to a node with available cpu power. > Where do affinity issues arise? > Large, long-running processes. My specific interest is virtualization with kvm, but I believe HPC and databases can make use of this as well. HPC currently solves the problem by statically allocating memory and cpu resources. -- error compiling committee.c: too many arguments to function -- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@...r.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
Powered by blists - more mailing lists