Changeset 0c40bfe for doc/theses/thierry_delisle_PhD/thesis/text/existing.tex

Timestamp:

Aug 23, 2022, 6:40:54 AM (2 years ago)

Author:

Peter A. Buhr <pabuhr@…>

Branches:

ADT, ast-experimental, master, pthread-emulation

Children:

8baa40aa

Parents:

4fee301 (diff), 94eff4c (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' of plg.uwaterloo.ca:software/cfa/cfa-cc

File:

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

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

@@ -50 +50 @@
 It can therefore be desirable for schedulers to support \ats with identical priorities and/or automatically setting and adjusting priorities for \ats.
 Most common operating systems use some variant on priorities with overlaps and dynamic priority adjustments.
-For example, Microsoft Windows uses a pair of priorities
-\cite{win:priority}, one specified by users out of ten possible options and one adjusted by the system.
+For example, Microsoft Windows uses a pair of priorities~\cite{win:priority}, one specified by users out of ten possible options and one adjusted by the system.
 
 \subsection{Uninformed and Self-Informed Dynamic Schedulers}
@@ -137 +136 @@
 The scheduler may also temporarily adjust priorities after certain effects like the completion of I/O requests.
 
-In~\cite{russinovich2009windows}, Chapter 1 section ``Processes, Threads, and Jobs'' discusses the scheduling policy more in depth.
-Multicore scheduling is based on a combination of priorities, preferred \proc.
-Each \at is assigned an \newterm{ideal} \proc using a round-robin policy.
-\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.
+In~\cite{russinovich2009windows}, Chapter 1 section ``Processes, Threads, and Jobs''\todo{Look up section number.} discusses the scheduling policy more in depth.
+Multicore scheduling is based on a combination of priorities and preferred \proc.
+Each \at is assigned an initial processor using a round-robin policy, called the \at's \newterm{ideal} \proc.
+\Glspl{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 approach is a variation of work stealing, where the stealing \proc restore the \at to its original \proc after running it, but mixed with priorities.
 
 \paragraph{Apple OS X}
@@ -203 +202 @@
 
 \paragraph{Grand Central Dispatch}
-An Apple\cite{apple:gcd} API that offers task parallelism~\cite{wiki:taskparallel}.
+An Apple~\cite{apple:gcd} API that offers task parallelism~\cite{wiki:taskparallel}.
 Its distinctive aspect is multiple ``Dispatch Queues'', some of which are created by programmers.
 Each queue has its own local ordering guarantees, \eg \ats on queue $A$ are executed in \emph{FIFO} order.
 
-While the documentation only gives limited insight into the scheduling and load balancing approach, \cite{apple:gcd2} suggests an approach fairly classic;
-Where each \proc has a queue of \newterm{blocks} to run, effectively \ats, and they drain their respective queues in \glsxtrshort{fifo}.
-They seem to add the concept of dependent queues with clear ordering, where a executing a block ends-up scheduling more blocks.
-In terms of semantics, these Dispatch Queues seem to be very similar to Intel\textregistered ~TBB @execute()@ and predecessor semantics.
+While the documentation only gives limited insight into the scheduling and load balancing approach, \cite{apple:gcd2} suggests a fairly classic approach.
+Each \proc has a queue of \ats to run, called \newterm{blocks}, which are drained in \glsxtrshort{fifo}.
+\todo{update: They seem to add the concept of dependent queues with clear ordering, where executing a block ends-up scheduling more blocks.
+In terms of semantics, these Dispatch Queues seem to be very similar to Intel\textregistered ~TBB \lstinline{execute()} and predecessor semantics.}
+
 
 \paragraph{LibFibre}