Changeset def751f for doc/theses/thierry_delisle_PhD/thesis/text/core.tex

Timestamp:

Jul 25, 2022, 3:17:25 PM (3 years ago)

Author:

JiadaL <j82liang@…>

Branches:

ADT, ast-experimental, master, pthread-emulation, qualifiedEnum

Children:

b0d9ff7

Parents:

4e2befe3 (diff), ffec1bf (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.

Message:

Merge branch 'master' into qualifiedEnum

File:

• doc/theses/thierry_delisle_PhD/thesis/text/core.tex (modified) (3 diffs)

doc/theses/thierry_delisle_PhD/thesis/text/core.tex

@@ -322 +322 @@
 Building a scheduler that is cache aware poses two main challenges: discovering the cache topology and matching \procs to this cache structure.
 Unfortunately, there is no portable way to discover cache topology, and it is outside the scope of this thesis to solve this problem.
-This work uses the cache topology information from Linux's \texttt{/sys/devices/system/cpu} directory.
+This work uses the cache topology information from Linux's @/sys/devices/system/cpu@ directory.
 This leaves the challenge of matching \procs to cache structure, or more precisely identifying which subqueues of the ready queue are local to which subcomponents of the cache structure.
 Once a matching is generated, the helping algorithm is changed to add bias so that \procs more often help subqueues local to the same cache substructure.\footnote{
@@ -330 +330 @@
 Instead of having each subqueue local to a specific \proc, the system is initialized with subqueues for each hardware hyperthread/core up front.
 Then \procs dequeue and enqueue by first asking which CPU id they are executing on, in order to identify which subqueues are the local ones.
-\Glspl{proc} can get the CPU id from \texttt{sched\_getcpu} or \texttt{librseq}.
+\Glspl{proc} can get the CPU id from @sched_getcpu@ or @librseq@.
 
 This approach solves the performance problems on systems with topologies with narrow L3 caches, similar to Figure \ref{fig:cache-noshare}.
@@ -341 +341 @@
 
 \subsection{Topological Work Stealing}
+\label{s:TopologicalWorkStealing}
 Therefore, the approach used in the \CFA scheduler is to have per-\proc subqueues, but have an explicit data-structure track which cache substructure each subqueue is tied to.
 This tracking requires some finesse because reading this data structure must lead to fewer cache misses than not having the data structure in the first place.