Index: doc/theses/thierry_delisle_PhD/thesis/text/core.tex
===================================================================
--- doc/theses/thierry_delisle_PhD/thesis/text/core.tex	(revision 175eba6d8a264ad54d3ba7d3abd2128309405355)
+++ doc/theses/thierry_delisle_PhD/thesis/text/core.tex	(revision 111d993609794ee670f2495d97fa281f12965924)
@@ -208,5 +208,5 @@
 The alternative is to do it the other way around.
 
-\section{Work Stealing++}
+\section{Work Stealing++}\label{helping}
 To add stronger fairness guarantees to work stealing a few changes are needed.
 First, the relaxed-FIFO algorithm has fundamentally better fairness because each \proc always monitors all subqueues.
@@ -261,5 +261,5 @@
 The good news is that this problem can be mitigated
 
-\subsection{Redundant Timestamps}
+\subsection{Redundant Timestamps}\ref{relaxedtimes}
 The problem with polling remote subqueues is that correctness is critical.
 There must be a consensus among \procs on which subqueues hold which \ats, as the \ats are in constant motion.
Index: doc/theses/thierry_delisle_PhD/thesis/text/intro.tex
===================================================================
--- doc/theses/thierry_delisle_PhD/thesis/text/intro.tex	(revision 175eba6d8a264ad54d3ba7d3abd2128309405355)
+++ doc/theses/thierry_delisle_PhD/thesis/text/intro.tex	(revision 111d993609794ee670f2495d97fa281f12965924)
@@ -22,7 +22,7 @@
 Chapter~\ref{intro} defines scheduling and its general goals.
 Chapter~\ref{existing} discusses how scheduler implementations attempt to achieve these goals, but all implementations optimize some workloads better than others.
-Chapter~\ref{s:CFARuntime} presents the relevant aspects of the \CFA runtime system that have a significant affect on the new scheduler design and implementation.
+Chapter~\ref{cfaruntime} presents the relevant aspects of the \CFA runtime system that have a significant affect on the new scheduler design and implementation.
 Chapter~\ref{core} analyses different scheduler approaches, while looking for scheduler mechanisms that provide both performance and fairness.
-Chapter~\ref{s:UserLevelIO} covers the complex mechanisms that must be used to achieve nonblocking I/O to prevent the blocking of \glspl{kthrd}.
+Chapter~\ref{userio} covers the complex mechanisms that must be used to achieve nonblocking I/O to prevent the blocking of \glspl{kthrd}.
 Chapter~\ref{practice} presents the mechanisms needed to adjust the amount of parallelism, both manually and automatically.
 Chapters~\ref{microbench} and~\ref{macrobench} present micro and macro benchmarks used to evaluate and compare the new scheduler with similar schedulers.
Index: doc/theses/thierry_delisle_PhD/thesis/text/io.tex
===================================================================
--- doc/theses/thierry_delisle_PhD/thesis/text/io.tex	(revision 175eba6d8a264ad54d3ba7d3abd2128309405355)
+++ doc/theses/thierry_delisle_PhD/thesis/text/io.tex	(revision 111d993609794ee670f2495d97fa281f12965924)
@@ -1,3 +1,3 @@
-\chapter{User Level \io}\label{s:UserLevelIO}
+\chapter{User Level \io}\label{userio}
 As mentioned in Section~\ref{prev:io}, user-level \io requires multiplexing the \io operations of many \glspl{thrd} onto fewer \glspl{proc} using asynchronous \io operations.
 Different operating systems offer various forms of asynchronous operations and, as mentioned in Chapter~\ref{intro}, this work is exclusively focused on the Linux operating-system.
Index: doc/theses/thierry_delisle_PhD/thesis/text/runtime.tex
===================================================================
--- doc/theses/thierry_delisle_PhD/thesis/text/runtime.tex	(revision 175eba6d8a264ad54d3ba7d3abd2128309405355)
+++ doc/theses/thierry_delisle_PhD/thesis/text/runtime.tex	(revision 111d993609794ee670f2495d97fa281f12965924)
@@ -1,3 +1,3 @@
-\chapter{\CFA Runtime}\label{s:CFARuntime}
+\chapter{\CFA Runtime}\label{cfaruntime}
 This chapter presents an overview of the capabilities of the \CFA runtime prior to this thesis work.