Changeset 30159e5


Ignore:
Timestamp:
Aug 1, 2022, 3:26:26 PM (19 months ago)
Author:
Peter A. Buhr <pabuhr@…>
Branches:
ADT, ast-experimental, master, pthread-emulation
Children:
4e21942
Parents:
ee0176b
Message:

add new paragraph

File:
1 edited

Legend:

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

    ree0176b r30159e5  
    113113However, this third challenge is outside the scope of this thesis because developing a general heuristic is complex enough to justify its own work.
    114114Therefore, the \CFA scheduler simply follows the ``Race-to-Idle''~\cite{Albers12} approach where a sleeping \proc is woken any time a \at becomes ready and \procs go to idle sleep anytime they run out of work.
     115
    115116An interesting sub-part of this heuristic is what to do with bursts of \ats that become ready.
    116117Since waking up a sleeping \proc can have notable latency, it is possible multiple \ats become ready while a single \proc is waking up.
Note: See TracChangeset for help on using the changeset viewer.