Ignore:
Timestamp:
May 18, 2021, 9:05:33 AM (3 years ago)
Author:
Peter A. Buhr <pabuhr@…>
Branches:
ADT, arm-eh, ast-experimental, 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:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/theses/mubeen_zulfiqar_MMath/allocator.tex

    rc2794b2 rd286e94d  
    11\chapter{Allocator}
    22
     3\noindent
    34====================
    45
    56Writing Points:
     7\begin{itemize}
     8\item
     9Objective of @uHeapLmmm@.
     10\item
     11Design philosophy.
     12\item
     13Background and previous design of @uHeapLmmm@.
     14\item
     15Distributed design of @uHeapLmmm@.
    616
    7 Objective of uHeapLmmm.
    8 Design philosophy.
    9 Background and previous design of uHeapLmmm.
     17----- SHOULD WE GIVE IMPLEMENTATION DETAILS HERE? -----
    1018
    11 Distributed design of uHeapLmmm.
    12 ----- SHOULD WE GIVE IMPLEMENTATION DETAILS HERE? -----
    13 > figure.
    14 > Advantages of distributed design.
     19\PAB{Maybe. There might be an Implementation chapter.}
     20\item
     21figure.
     22\item
     23Advantages of distributed design.
     24\end{itemize}
    1525
    16 The new features added to uHeapLmmm (incl. malloc_size routine)
    17 CFA alloc interface with examples.
    18 > Why did we need it?
    19 > The added benefits.
     26The new features added to @uHeapLmmm@ (incl. @malloc_size@ routine)
     27\CFA alloc interface with examples.
     28\begin{itemize}
     29\item
     30Why did we need it?
     31\item
     32The added benefits.
     33\end{itemize}
     34
    2035----- SHOULD WE GIVE PERFORMANCE AND USABILITY COMPARISON OF DIFFERENT INTERFACES THAT WE TRIED? -----
     36
     37\PAB{Often Performance is its own chapter. I added one for now.}
    2138
    2239Performance evaluation using u-benchmark suite.
    2340
     41\noindent
    2442====================
    2543
    2644\newpage
    2745\paragraph{Design 1: Decentralized}
    28 Fixed number of heaps: shard the heap into N heaps each with a bump-area allocated from the sbrk area.
     46Fixed number of heaps: shard the heap into N heaps each with a bump-area allocated from the @sbrk@ area.
    2947Kernel threads (KT) are assigned to the N heaps.
    3048When KTs $\le$ N, the heaps are uncontented.
Note: See TracChangeset for help on using the changeset viewer.