Fred Morcos <fred.morcos <at> gmail.com> writes: > .. > The improvement effect can be > noticed on large inputs. These algorithms will most probably perform quite > badly on small inputs.
I think your concern has been addressed in review of various algos where base case identification helped to avoid overhead cost in small problem sizes relative to cache. http://erikdemaine.org/papers/BRICS2002/paper.pdf In light of available but not implemented better VMM algos, perhaps *BSD and Linux could eliminate or reduce the need for: - swap space - swapping out RAM even if there is no lack of it - overcommitment of memory (a bluff asking to be punished by OOM killer) - OOM killer Besides, they allow sloppy/dangerous programming. jb _______________________________________________ [email protected] mailing list http://lists.freebsd.org/mailman/listinfo/freebsd-questions To unsubscribe, send any mail to "[email protected]"
