Index: doc/theses/thierry_delisle_PhD/thesis/text/existing.tex
===================================================================
--- doc/theses/thierry_delisle_PhD/thesis/text/existing.tex	(revision 29b0aa8b84c635df998cde0811ea4913548c91ea)
+++ doc/theses/thierry_delisle_PhD/thesis/text/existing.tex	(revision 4d85e47ce1d9a145f02b0ebdc7963bb786f6adc9)
@@ -140,5 +140,5 @@
 Multicore scheduling is based on a combination of priorities, preferred \proc.
 Each \at is assigned an \newterm{ideal} \proc using a round-robin policy.
-\Ats are distributed among the \procs according to their priority, preferring to match \ats to their ideal \proc and then to the last \proc they ran on.
+\Gls{at} are distributed among the \procs according to their priority, preferring to match \ats to their ideal \proc and then to the last \proc they ran on.
 This is similar to a variation of work stealing, where the stealing \proc restore the \at to its original \proc after running it, but with priorities added onto the mix.