Index: doc/theses/thierry_delisle_PhD/thesis/text/core.tex
===================================================================
--- doc/theses/thierry_delisle_PhD/thesis/text/core.tex	(revision aa604608d2321540dc3ac0caa5602b98fd9a19ad)
+++ doc/theses/thierry_delisle_PhD/thesis/text/core.tex	(revision 3e3bee2ff734fa908b412dfa985920442a5e30f6)
@@ -309,5 +309,5 @@
 \subsection{Topological Work Stealing}
 
-The approach used in the \CFA scheduler is to have per-\proc subqueues, but have an explicit data-structure track which cache substructure each subqueue is tied to.
+Therefore, the approach used in the \CFA scheduler is to have per-\proc subqueues, but have an explicit data-structure track which cache substructure each subqueue is tied to.
 This tracking requires some finesse because reading this data structure must lead to fewer cache misses than not having the data structure in the first place.
 A key element however is that, like the timestamps for helping, reading the cache instance mapping only needs to give the correct result \emph{often enough}.
@@ -316,2 +316,4 @@
 To avoid unnecessary cache line invalidation, the map is only written to if the mapping changes.
 
+This scheduler is used in the remainder of the thesis for managing CPU execution, but additional scheduling is needed to handle long-term blocking and unblocking, such as I/O.
+