linux-kernel - Re: Does the kernel page the CFS's red-black tree nodes?

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

Hash Suite for Android: free password hash cracker in your pocket

[<prev] [next>] [<thread-prev] [day] [month] [year] [list]

Date:	Thu, 17 Jun 2010 10:04:55 +0200
From:	Andi Kleen <andi@...stfloor.org>
To:	Richard Yao <shiningarcanine@...il.com>
Cc:	linux-kernel@...r.kernel.org
Subject: Re: Does the kernel page the CFS's red-black tree nodes?

Richard Yao <shiningarcanine@...il.com> writes:
>
> With that said, does the kernel page the CFS's red-black tree nodes to
> swap? If it does, it might be a good idea to reimplement the CFS'
> Red-Black trees in B-Trees, which would minimize slow-downs from
> vm-pressure and also have the additional benefit of minimizing cache
> misses caused by tree traversal.

The kernel does not swap itself, but yes in theory btrees might help to 
improve CPU cache locality.

-Andi

-- 
ak@...ux.intel.com -- Speaking for myself only.
--
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/