On Sat, Jan 29, 2011 at 5:25 PM, Dean Michael Berris <mikhailberis@gmail.com> wrote:
Try a simple benchmark: malloc a 1GB randomly generated file into a 64-bit multi-core Intel nehalem based processor, spawn 1,000 threads on Linux and randomly on each thread change a value in a randomly picked offset. This will show you how cache misses, VMM paging, and the cost of mutability of data will actually kill your efficiency. Now if you change the program to just randomly read from a part of memory, you'll see how immutability helps. Then change it yet again to malloc 1GB worth of data but this time on multiple files breaking them files up into smaller pieces. The dramatic improvement in performance should be evident there. :)
s/malloc/mmap/g :D -- Dean Michael Berris about.me/deanberris