Ignore:
Timestamp:
Sep 4, 2020, 12:53:33 PM (4 years ago)
Author:
Thierry Delisle <tdelisle@…>
Branches:
ADT, arm-eh, ast-experimental, enum, forall-pointer-decay, jacob/cs343-translation, master, new-ast-unique-expr, pthread-emulation, qualifiedEnum
Children:
1c507eb
Parents:
62f38ff
Message:

Fix typo where threads where referred to as tasks

File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/theses/thierry_delisle_PhD/comp_II/comp_II.tex

    r62f38ff r5a1c9ef  
    129129As a hard requirement, the \CFA scheduler must guarantee eventual progress, otherwise the above-mentioned illusion of simultaneous execution is broken and the scheduler becomes much more complex to reason about.
    130130\newterm{Predictability} and \newterm{reliability} mean similar workloads achieve similar performance and programmer execution intuition is respected.
    131 For example, a thread that yields aggressively should not run more often than other tasks.
     131For example, a thread that yields aggressively should not run more often than other threads.
    132132While this is intuitive, it does not hold true for many work-stealing or feedback based schedulers.
    133133The \CFA scheduler must guarantee eventual progress and should be predictable and offer reliable performance.
     
    213213Popping is done by selecting two queues at random and popping from the queue with the oldest timestamp.
    214214A higher number of underlying queues lead to less contention on each queue and therefore better performance.
    215 In a loaded system, it is highly likely the queues are non-empty, \ie several tasks are on each of the underlying queues.
     215In a loaded system, it is highly likely the queues are non-empty, \ie several threads are on each of the underlying queues.
    216216This means that selecting a queue at random to pop from is highly likely to yield a queue with available items.
    217217In Figure~\ref{fig:base}, ignoring the ellipsis, the chances of getting an empty queue is 2/7 per pick, meaning two random picks yield an item approximately 9 times out of 10.
Note: See TracChangeset for help on using the changeset viewer.