Index: doc/theses/thierry_delisle_PhD/thesis/text/conclusion.tex
===================================================================
--- doc/theses/thierry_delisle_PhD/thesis/text/conclusion.tex	(revision 836cf64750d8673d07ad0bf683e6720a85990abc)
+++ doc/theses/thierry_delisle_PhD/thesis/text/conclusion.tex	(revision 680137ac60d2dd6118af62a5e45a9ddb246da624)
@@ -9,5 +9,5 @@
 However, in doing so I discovered two expected challenges.
 First, while modern symmetric multiprocessing CPU have significant performance penalties for communicating across cores.
-This makes implementing algorithm notably more difficult, since fairness generally requires \procs to be aware of each other's progress.
+This makes implementing fair schedulers notably more difficult, since fairness generally requires \procs to be aware of each other's progress.
 This challenge is made even harder when comparing against MQMS schedulers (see Section\ref{sched}) which have very little inter-\proc communication.
 This is particularly true of state-of-the-art work-stealing schedulers, which can have virtually no inter-\proc communication in some common workloads.