Changeset 29d8c02 for doc/theses/mubeen_zulfiqar_MMath/intro.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/intro.tex (modified) (6 diffs)

doc/theses/mubeen_zulfiqar_MMath/intro.tex

@@ -53 +53 @@
 When this allocator proves inadequate, programmers often write specialize allocators for specific needs.
 C and \CC allow easy replacement of the default memory allocator with an alternative specialized or general-purpose memory-allocator.
-(Jikes RVM MMTk~\cite{MMTk} provides a similar generalization for the Java virtual machine.)
+Jikes RVM MMTk~\cite{MMTk} provides a similar generalization for the Java virtual machine.
 However, high-performance memory-allocators for kernel and user multi-threaded programs are still being designed and improved.
 For this reason, several alternative general-purpose allocators have been written for C/\CC with the goal of scaling in a multi-threaded program~\cite{Berger00,mtmalloc,streamflow,tcmalloc}.
@@ -65 +65 @@
 \begin{enumerate}[leftmargin=*]
 \item
-Implementation of a new stand-lone concurrent low-latency memory-allocator ($\approx$1,200 lines of code) for C/\CC programs using kernel threads (1:1 threading), and specialized versions of the allocator for the programming languages \uC and \CFA using user-level threads running over multiple kernel threads (M:N threading).
-
-\item
-Adopt @nullptr@ return for a zero-sized allocation, rather than an actual memory address, which can be passed to @free@.
+Implementation of a new stand-alone concurrent low-latency memory-allocator ($\approx$1,200 lines of code) for C/\CC programs using kernel threads (1:1 threading), and specialized versions of the allocator for the programming languages \uC and \CFA using user-level threads running over multiple kernel threads (M:N threading).
 
 \item
@@ -104 +101 @@
 
 \item
-Provide additional heap wrapper functions in \CFA creating an orthogonal set of allocation operations and properties.
+Provide additional heap wrapper functions in \CFA creating a more usable set of allocation operations and properties.
 
 \item
@@ -111 +108 @@
 \item
 @malloc_alignment( addr )@ returns the alignment of the allocation pointed-to by @addr@.
-If the allocation is not aligned or @addr@ is the @nulladdr@, the minimal alignment is returned.
+If the allocation is not aligned or @addr@ is the @NULL@, the minimal alignment is returned.
 \item
 @malloc_zero_fill( addr )@ returns a boolean result indicating if the memory pointed-to by @addr@ is allocated with zero fill, e.g., by @calloc@/@cmemalign@.
@@ -119 +116 @@
 @malloc_usable_size( addr )@ returns the usable (total) size of the memory pointed-to by @addr@, i.e., the bin size containing the allocation, where @malloc_size( addr )@ $\le$ @malloc_usable_size( addr )@.
 \end{itemize}
-
-\item
-Provide mostly contention-free allocation and free operations via a heap-per-kernel-thread implementation.
 
 \item
@@ -136 +130 @@
 
 \item
-Provide extensive runtime checks to valid allocation operations and identify the amount of unfreed storage at program termination.
+Provide extensive runtime checks to validate allocation operations and identify the amount of unfreed storage at program termination.
 
 \item