Index: doc/theses/thierry_delisle_PhD/thesis/text/conclusion.tex
===================================================================
--- doc/theses/thierry_delisle_PhD/thesis/text/conclusion.tex	(revision 7e5da64c14b3c725edda822f5a1f3e139c9f86d6)
+++ doc/theses/thierry_delisle_PhD/thesis/text/conclusion.tex	(revision b443db063ba041699280cd09c9cdb6cc92a7ed07)
@@ -30,11 +30,4 @@
 
 \section{Goals}
-
-The underlying goal of this thesis is scheduling the complex hardware components that make up a computer to provide good utilization and fairness.
-However, direct hardware scheduling is only possible in the OS.
-Instead, this thesis is performing arms-length application scheduling of the hardware components through a complex set of OS interfaces that indirectly manipulate the hardware components.
-Couple that with the OS running multiple applications with its own goals for scheduling among them.
-Hence, my goal became the battle of two schedulers.
-
 This work focusses on efficient and fair scheduling of the multiple CPUs, which are ubiquitous on all modern computers.
 The levels of indirection to the CPUs are:
@@ -47,13 +40,12 @@
 The OS and library presentation of disk and network I/O, and many secondary library routines that directly and indirectly use these mechanisms.
 \end{itemize}
-The key aspect of all of these mechanisms is that control flow can block, which is the enemy of the scheduler.
+The key aspect of all of these mechanisms is that control flow can block, which immidiately hinders any level above from making scheduling decision as a result.
 Fundamentally, scheduling needs to understand all the mechanisms used by threads that affect their state changes.
 
-Interestingly, there is another major hardware component that affects threading: memory.
-How memory is organized, and when it is acquired and released, has a significant affect on thread scheduling.
-To this end, I worked closely with another graduate student, Mubeen Zulfiqar, in the development of a new memory allocator for \CFA.
-(See Mubeen's thesis~\cite{Zulfiqar22} for a discussion of how threading is managed in the \CFA memory-allocator.)
+The underlying goal of this thesis is scheduling the complex hardware components that make up a computer to provide good utilization and fairness.
+However, direct hardware scheduling is only possible in the OS.
+Instead, this thesis is performing arms-length application scheduling of the hardware components through a set of OS interfaces that indirectly manipulate the hardware components.
+This can quickly lead to tensions if the OS interface was built with different use cases in mind.
 
-% An important aspect of this approach to threading is how threads are scheduled.
 As \CFA aims to increase productivity and safety of C, while maintaining its performance, this places a huge burden on the \CFA runtime to achieve these goals.
 Productivity and safety manifest in removing scheduling pitfalls in the efficient usage of the threading runtime.