Index: doc/theses/thierry_delisle_PhD/thesis/text/practice.tex
===================================================================
--- doc/theses/thierry_delisle_PhD/thesis/text/practice.tex	(revision 999faf1d0f84443e7a8389ee43d89e89fb20bf07)
+++ doc/theses/thierry_delisle_PhD/thesis/text/practice.tex	(revision 30159e5e29aba584a347c2ecaf2cb5eacb8d5856)
@@ -113,4 +113,5 @@
 However, this third challenge is outside the scope of this thesis because developing a general heuristic is complex enough to justify its own work.
 Therefore, the \CFA scheduler simply follows the ``Race-to-Idle''~\cite{Albers12} approach where a sleeping \proc is woken any time a \at becomes ready and \procs go to idle sleep anytime they run out of work.
+
 An interesting sub-part of this heuristic is what to do with bursts of \ats that become ready.
 Since waking up a sleeping \proc can have notable latency, it is possible multiple \ats become ready while a single \proc is waking up.