Index: doc/theses/mubeen_zulfiqar_MMath/conclusion.tex =================================================================== --- doc/theses/mubeen_zulfiqar_MMath/conclusion.tex (revision 37ef5e41b0a0ef845d5bf02543ee3db8f706bdb5) +++ doc/theses/mubeen_zulfiqar_MMath/conclusion.tex (revision 8eeca775ea588632fd11cdfa6b292652118a10f3) @@ -32,10 +32,10 @@ Finally, contention-free statistics gathering and debugging have a low enough cost to be used in production code. -The ability to compile llheap static/dynamic linking and optional statistics/debugging provides programers with multiple mechanisms to balance performance and safety. -These allocator versions are easy to use because can be linked to an application without recompilation. +The ability to compile llheap with static/dynamic linking and optional statistics/debugging provides programers with multiple mechanisms to balance performance and safety. +These allocator versions are easy to use because they can be linked to an application without recompilation. Starting a micro-benchmark test-suite for comparing allocators, rather than relying on a suite of arbitrary programs, has been an interesting challenge. The current micro-benchmark allows some understand of allocator implementation properties without actually looking at the implementation. -For example, dmalloc and ptmalloc3 were quickly identified has having course-grain locking in the Speed micro-benchmark. +For example, the memory micro-benchmark quickly identified how several of the allocators work at the global level. It was not possible to show how the micro-benchmarks adjustment knobs were used to tune to an interesting test point. Many graphs were created and discarded until a few were selected for the thesis. @@ -45,4 +45,5 @@ A careful walk-though of the allocator fastpath should yield additional optimizations for a slight performance gain. +In particular, looking at the implementation of rpmalloc, which is often the fastest allocator, The micro-benchmarks project requires more testing and analysis.