On Thu, 26 Apr 2007, Nick Piggin wrote:Me? Radix tree based approach? That approach is in the kernel. Do not create a solution where there is no problem. If we do not want to support large blocksizes then lets be honest and say so instead of redefining what a block is. The current approach is fine if one is satisfied with scatter gather and the VM overhead coming with handling these pages. I fail to see what any of what you are proposing would add to that. Lets be clear here: A bigger page cache size if its just one is not useful. 4k page size is a good size for many files on the system and chaning it would break the binary format.. I just do not want it to be the only one because different usage scenarios may require differnet page sizes for optimal application performance. -
| Greg KH | [GIT PATCH] driver core patches against 2.6.24 |
| Tarkan Erimer | Re: Dual-Licensing Linux Kernel with GPL V2 and GPL V3 |
| Amit K. Arora | [RFC] Heads up on sys_fallocate() |
| Chuck Ebbert | Why do so many machines need "noapic"? |
git: | |
| Jarek Poplawski | [PATCH] pkt_sched: Destroy gen estimators under rtnl_lock(). |
| David Miller | [GIT]: Networking |
| Gerrit Renker | [PATCH 27/37] dccp: Integration of dynamic feature activation - part 2 (server side) |
| Natalie Protasevich | [BUG] New Kernel Bugs |
