Index: doc/theses/mubeen_zulfiqar_MMath/benchmarks.tex =================================================================== --- doc/theses/mubeen_zulfiqar_MMath/benchmarks.tex (revision 381495789427d10a74449ea5dff50edf33656ba2) +++ doc/theses/mubeen_zulfiqar_MMath/benchmarks.tex (revision 32318deb8d06b98437b9cfecdd25a6042f8d7927) @@ -133,16 +133,102 @@ The aim of micro benchmark suite is to create a set of programs that can evaluate a memory allocator based on the performance matrices described in (FIX ME: local cite). These programs can be taken as a standard to benchmark an allocator's basic goals. These programs give details of an allocator's memory overhead and speed under a certain allocation pattern. The speed of the allocator is benchmarked in different ways. Similarly, false sharing happening in an allocator is also measured in multiple ways. These benchmarks evalute the allocator under a certain allocation pattern which is configurable and can be changed using a few knobs to benchmark observe an allocator's performance under a desired allocation pattern. -TO DO before writing furthur: Finalize figures +Micro Benchmark Suite benchmarks an allocator's performance by allocating dynamic objects and, then, measuring specifc matrices. The benchmark suite evaluates an allocator with a certain allocation pattern. Bnechmarks have different knobs that can be used to change allocation pattern and evaluate an allocator under desired conditions. These can be set by giving commandline arguments to the benchmark on execution. + +Following is the list of avalable knobs. + +*** FIX ME: Add knobs items after finalize /subsection Memory Benchmark + Memory benchmark measures memory overhead of an allocator. It allocates a number of dynamic objects. Then, by reading /self/proc/maps, gets the total memory that the allocator has reuested from the OS. Finally, it calculates the memory head by taking the difference between the memory the allocator has requested from the OS and the memory that program has allocated. + *** FIX ME: Insert a figure of above benchmark with description + + /subsubsection Relevant Knobs + *** FIX ME: Insert Relevant Knobs + /subsection Speed Benchmark + Speed benchmark calculates the runtime speed of an allocator's functions (FIX ME: cite allocator routines). It does by measuring the runtime of allocator routines in two different ways. + /subsubsection Speed Time + The time method does a certain amount of work by calling each routine of the allocator (FIX ME: cite allocator routines) a specific time. It calculates the total time it took to perform this workload. Then, it divides the time it took by the workload and calculates the average time taken by the allocator's routine. + *** FIX ME: Insert a figure of above benchmark with description + + /subsubsubsection Relevant Knobs + *** FIX ME: Insert Relevant Knobs + /subsubsection Speed Workload + The worload method uses the opposite approach. It calls the allocator's routines for a specific amount of time and measures how much work was done during that time. Then, similar to the time method, it divides the time by the workload done during that time and calculates the average time taken by the allocator's routine. + *** FIX ME: Insert a figure of above benchmark with description + + /subsubsubsection Relevant Knobs + *** FIX ME: Insert Relevant Knobs /subsection Cache Scratch + Cache Scratch benchmark measures program induced allocator preserved passive false sharing (FIX ME CITE) in an allocator. It does so in two ways. + /subsubsection Cache Scratch Time + Cache Scratch Time allocates dynamic objects. Then, it benchmarks program induced allocator preserved passive false sharing (FIX ME CITE) in an allocator by measuring the time it takes to read/write these objects. + *** FIX ME: Insert a figure of above benchmark with description + + /subsubsubsection Relevant Knobs + *** FIX ME: Insert Relevant Knobs + /subsubsection Cache Scratch Layout + Cache Scratch Layout also allocates dynamic objects. Then, it benchmarks program induced allocator preserved passive false sharing (FIX ME CITE) by using heap addresses returned by the allocator. It calculates how many objects were allocated to different threads on the same cache line. + *** FIX ME: Insert a figure of above benchmark with description + + /subsubsubsection Relevant Knobs + *** FIX ME: Insert Relevant Knobs /subsection Cache Thrash + Cache Thrash benchmark measures allocator induced passive false sharing (FIX ME CITE) in an allocator. It also does so in two ways. + /subsubsection Cache Thrash Time + Cache Thrash Time allocates dynamic objects. Then, it benchmarks allocator induced false sharing (FIX ME CITE) in an allocator by measuring the time it takes to read/write these objects. + *** FIX ME: Insert a figure of above benchmark with description + + /subsubsubsection Relevant Knobs + *** FIX ME: Insert Relevant Knobs + /subsubsection Cache Thrash Layout + Cache Thrash Layout also allocates dynamic objects. Then, it benchmarks allocator induced false sharing (FIX ME CITE) by using heap addresses returned by the allocator. It calculates how many objects were allocated to different threads on the same cache line. + *** FIX ME: Insert a figure of above benchmark with description + + /subsubsubsection Relevant Knobs + *** FIX ME: Insert Relevant Knobs + +/section Results +*** FIX ME: add configuration details of memory allocators + + /subsection Memory Benchmark + + /subsubsection Relevant Knobs + + /subsection Speed Benchmark + + /subsubsection Speed Time + + /subsubsubsection Relevant Knobs + + /subsubsection Speed Workload + + /subsubsubsection Relevant Knobs + + /subsection Cache Scratch + + /subsubsection Cache Scratch Time + + /subsubsubsection Relevant Knobs + + /subsubsection Cache Scratch Layout + + /subsubsubsection Relevant Knobs + + /subsection Cache Thrash + + /subsubsection Cache Thrash Time + + /subsubsubsection Relevant Knobs + + /subsubsection Cache Thrash Layout + + /subsubsubsection Relevant Knobs