Changeset d286e94d for doc/theses/mubeen_zulfiqar_MMath/allocator.tex

Timestamp:

May 18, 2021, 9:05:33 AM (2 years ago)

Author:

Peter A. Buhr <pabuhr@…>

Branches:

ADT, arm-eh, enum, forall-pointer-decay, jacob/cs343-translation, master, new-ast-unique-expr, pthread-emulation, qualifiedEnum

Children:

63f42a8

Parents:

c2794b2

Message:

comment on Mubeen's thesis writing-points

File:

• doc/theses/mubeen_zulfiqar_MMath/allocator.tex (modified) (1 diff)

doc/theses/mubeen_zulfiqar_MMath/allocator.tex

@@ -1 +1 @@
 \chapter{Allocator}
 
+\noindent
 ====================
 
 Writing Points:
+\begin{itemize}
+\item
+Objective of @uHeapLmmm@.
+\item
+Design philosophy.
+\item
+Background and previous design of @uHeapLmmm@.
+\item
+Distributed design of @uHeapLmmm@.
 
-Objective of uHeapLmmm.
-Design philosophy.
-Background and previous design of uHeapLmmm.
+----- SHOULD WE GIVE IMPLEMENTATION DETAILS HERE? -----
 
-Distributed design of uHeapLmmm.
------ SHOULD WE GIVE IMPLEMENTATION DETAILS HERE? -----
-> figure.
-> Advantages of distributed design.
+\PAB{Maybe. There might be an Implementation chapter.}
+\item
+figure.
+\item
+Advantages of distributed design.
+\end{itemize}
 
-The new features added to uHeapLmmm (incl. malloc_size routine)
-CFA alloc interface with examples.
-> Why did we need it?
-> The added benefits.
+The new features added to @uHeapLmmm@ (incl. @malloc_size@ routine)
+\CFA alloc interface with examples.
+\begin{itemize}
+\item
+Why did we need it?
+\item
+The added benefits.
+\end{itemize}
+
 ----- SHOULD WE GIVE PERFORMANCE AND USABILITY COMPARISON OF DIFFERENT INTERFACES THAT WE TRIED? -----
+
+\PAB{Often Performance is its own chapter. I added one for now.}
 
 Performance evaluation using u-benchmark suite.
 
+\noindent
 ====================
 
 \newpage
 \paragraph{Design 1: Decentralized}
-Fixed number of heaps: shard the heap into N heaps each with a bump-area allocated from the sbrk area.
+Fixed number of heaps: shard the heap into N heaps each with a bump-area allocated from the @sbrk@ area.
 Kernel threads (KT) are assigned to the N heaps.
 When KTs $\le$ N, the heaps are uncontented.