Index: doc/theses/thierry_delisle_PhD/thesis/text/front.tex
===================================================================
--- doc/theses/thierry_delisle_PhD/thesis/text/front.tex	(revision 3fe4acddc077a08a2e9a923cc8d17ca9a0979373)
+++ doc/theses/thierry_delisle_PhD/thesis/text/front.tex	(revision 80d16f8b997b4ea43d9fbf8a9b702957d583e2bc)
@@ -143,7 +143,7 @@
 The new scheduler achieves this goal by demonstrating equivalent performance to work-stealing schedulers while offering better fairness.
 The implementation uses several optimizations that successfully balance the cost of fairness against performance;
-some of these optimization rely on interesting hardware optimizations present on modern CPUs.
+some of these optimizations rely on interesting hardware optimizations present on modern CPUs.
 The new scheduler also includes support for implicit nonblocking \io, allowing applications to have more user-threads blocking on \io operations than there are \glspl{kthrd}.
-The implementation is based on @io_uring@, a recent addition to the Linux kernel, and achieves the same performance and fairness.
+The implementation is based on @io_uring@, a recent addition to the Linux kernel, and achieves the same performance and fairness as systems using @select@, @epoll@, \etc.
 To complete the scheduler, an idle sleep mechanism is implemented that significantly reduces wasted CPU cycles, which are then available outside of the application.