Ignore:
Timestamp:
Sep 16, 2022, 3:40:19 PM (2 years ago)
Author:
Thierry Delisle <tdelisle@…>
Branches:
ADT, ast-experimental, master, pthread-emulation
Children:
d489da8
Parents:
09f34a84
Message:

Tiny changes as part of my final read-through

Location:
doc/theses/thierry_delisle_PhD/thesis/text
Files:
2 edited

Legend:

Unmodified
Added
Removed
  • doc/theses/thierry_delisle_PhD/thesis/text/existing.tex

    r09f34a84 r4407b7e  
    2222The scheduler then processes this input ahead of time and produces a \newterm{schedule} the system follows during execution.
    2323This approach is popular in real-time systems since the need for strong guarantees justifies the cost of determining and supplying this information.
    24 In general, static schedulers are less relevant to this project because they require input from the programmers that the programming language does not have as part of its concurrency semantics.
     24In general, static schedulers are less relevant to this project because they require input from the programmers that the \CFA programming language does not have as part of its concurrency semantics.
    2525Specifying this information explicitly adds a significant burden to the programmer and reduces flexibility.
    2626For this reason, the \CFA scheduler does not require this information.
     
    217217While the documentation only gives limited insight into the scheduling and load balancing approach, \cite{apple:gcd2} suggests a fairly classic approach.
    218218Each \proc has a queue of \ats to run, called \newterm{blocks}, which are drained in \glsxtrshort{fifo}.
    219 GCD also has secondary queues, called \newterm{Dispatch Queues} with clear ordering, where executing a block ends up scheduling more blocks.
     219GCD also has secondary queues, called \newterm{Dispatch Queues}, with clear ordering, where executing a block ends up scheduling more blocks.
    220220In terms of semantics, these Dispatch Queues seem to be very similar to Intel\textregistered ~TBB \lstinline{execute()} and predecessor semantics.
    221221
  • doc/theses/thierry_delisle_PhD/thesis/text/front.tex

    r09f34a84 r4407b7e  
    6666        Internal-External Member: \=  \kill % using longest text to define tab length
    6767        External Examiner: \>  Doug Lea \\
    68         \> Professor and Department Chair, Computer Science Department \\
     68        \> Professor, Computer Science Department \\
    6969        \> State University of New York at Oswego \\
    7070\end{tabbing}
Note: See TracChangeset for help on using the changeset viewer.