-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 On Tuesday, 2010-02-16 at 18:59 -0500, Anton Aylward wrote:
I might also mention in passing that file systems which use a b-tree directory structure let the kernel do faster name lookup.
reiserfs? What we are talking about reminds me of databases. If something needs loading dozens of files, and there is a cost to finding them, then perhaps we are using the wrong tools. Or perhaps the strategy would be to write a single file compiling the contents of all those files (configuration or data). But then, there would be the need of detecting if one of those files has changed and the compendium has to be regenerated, and that would be costly if needed to be run on every start. So that would be a database :-)
Item #6 is really playing around with the Virtual memory and swapping/paging. There's one argument which says that code pages don't need to be paged-out, just freed, because they are code and can be paged in - again - when needed from the original file - which is mapped anyway. So the cost of writing code pages to disk doesn't make sense.
Actually, that is what windows code does. At least, so they said, back in 3.1. But, methinks, if the code needs to be re-read several times during the time, perhaps it would be faster to load instead from a pagefile/swapspace, which is contiguous by design.
The other argument revolves around somehow determining the working set and - which doesn't make sense in a heavily multi-tasked setting - and keeping it around as a contiguous block.
No, it doesn't. Other tasks may run in between and break the nicely pre-designed load sequence. - -- Cheers, Carlos E. R. -----BEGIN PGP SIGNATURE----- Version: GnuPG v2.0.9 (GNU/Linux) iEYEARECAAYFAkt7QfYACgkQtTMYHG2NR9WIlQCdGbD9NA9Cp3cjkIvYna2cWshY uNcAoIInVownXXRH+U2p1g4AC85QWy7k =JMsa -----END PGP SIGNATURE----- -- To unsubscribe, e-mail: opensuse+unsubscribe@opensuse.org For additional commands, e-mail: opensuse+help@opensuse.org