We never talked about not being able to solve scalability issues with this
patchset. The alternate approaches were discussed at the VM MiniSummit and
at the VM/FS meeting. You organized the VM/FS summit. I know you were
there and were arguing for your approach. That was not sufficient?
We obviously have discussed this before and the only point of asking this
question by you seems to be to have me repeat the whole line argument
again?
Sorry but I have had too much exposure to philosophy. Talk about absolutes
like guarantees (that do not exist even for order 0 allocs) and unlikely memory
fragmentation scenarios to show that something does not work seems to
be getting into some metaphysical realm where there is no data anymore
to draw any firm conclusions.
Software reliability is inherent probabilistic otherwise we would not have
things like CRC sums and SHA1 algorithms. Its just a matter of reducing
the failure rate sufficiently. The failure rate for lower order
allocations (0-3) seems to have been significantly reduced in 2.6.23
through lumpy reclaim.
If antifrag measures are not successful (likely for 2M allocs) then other
methods (like the large page pools that you skipped when reading my post)
will need to be used.
-