Changeset 29d8c02 for doc/theses/mubeen_zulfiqar_MMath/performance.tex

Timestamp:

May 20, 2022, 10:36:32 AM (2 years ago)

Author:

m3zulfiq <m3zulfiq@…>

Branches:

ADT, ast-experimental, master, pthread-emulation, qualifiedEnum

Children:

74ec742

Parents:

d8075d28

Message:

made corrections in thesis as per feedback from the readers

File:

• doc/theses/mubeen_zulfiqar_MMath/performance.tex (modified) (7 diffs)

doc/theses/mubeen_zulfiqar_MMath/performance.tex

@@ -3 +3 @@
 
 This chapter uses the micro-benchmarks from \VRef[Chapter]{s:Benchmarks} to test a number of current memory allocators, including llheap.
-The goal is to see if llheap is competitive with the current best memory allocators.
+The goal is to see if llheap is competitive with the currently popular memory allocators.
 
 
@@ -11 +11 @@
 \begin{itemize}
 \item
+\textbf{Algol} Huawei ARM TaiShan 2280 V2 Kunpeng 920, 24-core socket $\times$ 4, 2.6 GHz, GCC version 9.4.0
+\item
 \textbf{Nasus} AMD EPYC 7662, 64-core socket $\times$ 2, 2.0 GHz, GCC version 9.3.0
-\item
-\textbf{Algol} Huawei ARM TaiShan 2280 V2 Kunpeng 920, 24-core socket $\times$ 4, 2.6 GHz, GCC version 9.4.0
 \end{itemize}
 
@@ -31 +31 @@
 
 \paragraph{glibc (\textsf{glc})}
-\cite{glibc} is the default gcc thread-safe allocator.
+\cite{glibc} is the default glibc thread-safe allocator.
 \\
 \textbf{Version:} Ubuntu GLIBC 2.31-0ubuntu9.7 2.31\\
@@ -46 +46 @@
 
 \paragraph{hoard (\textsf{hrd})}
-\cite{hoard} is a thread-safe allocator that is multi-threaded and using a heap layer framework. It has per-thread heaps that have thread-local free-lists, and a global shared heap.
+\cite{hoard} is a thread-safe allocator that is multi-threaded and uses a heap layer framework. It has per-thread heaps that have thread-local free-lists, and a global shared heap.
 \\
 \textbf{Version:} 3.13\\
@@ -78 +78 @@
 
 \paragraph{tbb malloc (\textsf{tbb})}
-\cite{tbbmalloc} is a thread-safe allocator that is multi-threaded and uses private heap for each thread.
+\cite{tbbmalloc} is a thread-safe allocator that is multi-threaded and uses a private heap for each thread.
 Each private-heap has multiple bins of different sizes. Each bin contains free regions of the same size.
 \\
@@ -90 +90 @@
 \section{Experiments}
 
-The each micro-benchmark is configured and run with each of the allocators,
-The less time an allocator takes to complete a benchmark the better, so lower in the graphs is better.
+Each micro-benchmark is configured and run with each of the allocators,
+\PAB{The less time an allocator takes to complete a benchmark the better so lower in the graphs is better, except for the Memory micro-benchmark graphs.}
 All graphs use log scale on the Y-axis, except for the Memory micro-benchmark (see \VRef{s:MemoryMicroBenchmark}).
 
@@ -231 +231 @@
 Second is the low-performer group, which includes the rest of the memory allocators.
 These memory allocators have significant program-induced passive false-sharing, where \textsf{hrd}'s is the worst performing allocator.
-All of the allocator's in this group are sharing heaps among threads at some level.
-
-Interestingly, allocators such as \textsf{hrd} and \textsf{glc} performed well in micro-benchmark cache thrash (see \VRef{sec:cache-thrash-perf}).
-But, these allocators are among the low performers in the cache scratch.
-It suggests these allocators do not actively produce false-sharing but preserve program-induced passive false sharing.
+All of the allocators in this group are sharing heaps among threads at some level.
+
+Interestingly, allocators such as \textsf{hrd} and \textsf{glc} performed well in micro-benchmark cache thrash (see \VRef{sec:cache-thrash-perf}), but, these allocators are among the low performers in the cache scratch.
+It suggests these allocators do not actively produce false-sharing, but preserve program-induced passive false sharing.
 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%