Index: doc/theses/thierry_delisle_PhD/thesis/glossary.tex
===================================================================
--- doc/theses/thierry_delisle_PhD/thesis/glossary.tex	(revision 4a2d728a59affeff5fc1c5192c46918d994c6782)
+++ doc/theses/thierry_delisle_PhD/thesis/glossary.tex	(revision b0ceb72635ab09a855112396e6c0ddecf662ab2c)
@@ -17,5 +17,5 @@
 {name={Thread},text={thread}}
 {
-A thread is an independent sequential execution path through a program. Each thread is scheduled for execution separately and independently from other threads. A thread must have its own stack to save its state when it is scheduled. Systems offer one or more concrete implementations of this concept, \eg \gls{kthrd}, \gls{job}, task. However, most of the concepts of scheduling are independent of the particular implementations of the thread representation. For this reason, this document uses the term \gls{at} to mean any of these representation that meets the general definition.
+A thread is an independent sequential execution path through a program. Each thread is scheduled for execution separately and independently from other threads. Systems offer one or more concrete implementations of this concept, \eg \gls{kthrd}, \gls{job}, task. However, most of the concepts of scheduling are independent of the particular implementations of the thread representation. For this reason, this document uses the term \gls{at} to mean any of these representation that meets the general definition.
 
 \textit{Synonyms : Tasks, Jobs, Blocks.}
@@ -33,11 +33,11 @@
 {name={Ready Queue}, text={ready-queue}}
 {
-Data structure holding \ats that are ready to \glslink{atrun}{run}, but currently all the processors are in use. Often a \glsxtrshort{fifo} queue for fairness, but can take many different forms, \eg binary tree and priority queue are also common.
+Data structure holding \ats that are ready to \glslink{atrun}{run}. Often a \glsxtrshort{fifo} queue for fairness, but can take many different forms, \eg binary tree and priority queue are also common.
 }
 
 \longnewglossaryentry{uthrding}
-{name={User-Level \Gls{at}ing},text={user-level threading}}
+{name={User-Level Threading},text={user-level threading}}
 {
-\Gls{at}ing model where a scheduler runs in users space and maps threads managed and created inside the user-space onto \glspl{kthrd}.
+Threading model where a scheduler runs in users space and maps threads managed and created inside the user-space onto \glspl{kthrd}.
 
 \textit{Synonyms : User threads, Lightweight threads, Green threads, Virtual threads, Tasks.}
@@ -47,5 +47,5 @@
 {name={Remote Memory Reference},text={remote memory reference}}
 {
-A memory reference to an address not in the current \gls{hthrd}'s L1 or L2 cache is a remote reference. L1 and L2 cache references are considered \emph{local}. For example, a cache line that must be updated from the L3 cache or from any cache on another socket, or from RAM in a \glsxtrshort{numa} context.
+A memory reference to an address not in the current \gls{hthrd}'s cache is a remote reference. Memory references that \emph{are} in the current \gls{hthrd}'s cache is a \newterm{local} memory reference. For example, a cache line that must be updated from the any cache on another socket, or from RAM in a \glsxtrshort{numa} context.
 }
 
@@ -53,15 +53,15 @@
 
 \longnewglossaryentry{hthrd}
-{name={Hardware \Gls{at}},text={hardware thread}}
+{name={Hardware Threading},text={hardware thread}}
 {
-\Gls{at}s representing the underlying hardware, \eg a CPU core or hyper-thread, if the hardware supports multiple threads of execution per core. The maximum number of hardware threads is fixed on any given computer.
+Threads representing the underlying hardware, \eg a CPU core or hyper-thread, if the hardware supports multiple threads of execution per core. The number of hardware threads present is fixed on any given computer.
 
-\textit{Synonyms : Core, Hyper-\Gls{at}, Processing Unit, CPU.}
+\textit{Synonyms : Core, Hyper-Thread, Processing Unit, CPU.}
 }
 
 \longnewglossaryentry{kthrd}
-{name={Kernel-Level \Gls{at}},text={kernel-level thread}}
+{name={Kernel-Level Thread},text={kernel-level thread}}
 {
-\Gls{at}s created and managed inside kernel space. Each kernel thread has its own stack and its own thread of execution. Kernel-level threads are owned, managed and scheduled by the underlying operating system.
+Threads created and managed inside kernel space. Each kernel thread has its own stack and its own thread of execution. Kernel-level threads are owned, managed and scheduled by the underlying operating system.
 
 \textit{Synonyms : OS threads, Hardware threads, Physical threads.}
@@ -85,5 +85,5 @@
 
 \longnewglossaryentry{pool}
-{name={\Gls{at} Pool},text={thread-pool}}
+{name={Thread Pool},text={thread-pool}}
 {
 Group of homogeneous threads that loop executing units of works. Often executing \glspl{jobs}.