How do applications with large allocated arrays for numerics (say) get around the page size / memory fragmentation issue? Wouldn't one expect them to experience some slowdown when the system's memory gets heavily fragmented, if the basic arrays are significantly larger than the cache size? just wondering ...
Copyright © 2017, Eklektix, Inc.
Comments and public postings are copyrighted by their creators.
Linux is a registered trademark of Linus Torvalds