Changeset 72d1118 for doc/theses/thierry_delisle_PhD/thesis/text/practice.tex

Timestamp:

Sep 20, 2022, 2:42:15 PM (2 years ago)

Author:

Thierry Delisle <tdelisle@…>

Branches:

ADT, ast-experimental, master, pthread-emulation

Children:

8f1e035

Parents:

aa9f215

Message:

Finished final read

File:

• doc/theses/thierry_delisle_PhD/thesis/text/practice.tex (modified) (2 diffs)

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

@@ -101 +101 @@
 This leaves too many \procs when there are not enough \ats for all the \procs to be useful.
 These idle \procs cannot be removed because their lifetime is controlled by the application, and only the application knows when the number of \ats may increase or decrease.
-While idle \procs can spin until work appears, this approach wastes energy, unnecessarily produces heat and prevents other applications from using the processor.
+While idle \procs can spin until work appears, this approach wastes energy, unnecessarily produces heat and prevents other applications from using the \gls{hthrd}.
 Therefore, idle \procs are put into an idle state, called \newterm{Idle-Sleep}, where the \gls{kthrd} is blocked until the scheduler deems it is needed.
 
@@ -107 +107 @@
 First, a data structure needs to keep track of all \procs that are in idle sleep.
 Because idle sleep is spurious, this data structure has strict performance requirements, in addition to strict correctness requirements.
-Next, some mechanism is needed to block \glspl{kthrd}, \eg @pthread_cond_wait@ on a pthread semaphore.
+Next, some mechanism is needed to block \glspl{kthrd}, \eg @pthread_cond_wait@ or a pthread semaphore.
 The complexity here is to support \at \glslink{atblock}{parking} and \glslink{atsched}{unparking}, user-level locking, timers, \io operations, and all other \CFA features with minimal complexity.
 Finally, the scheduler needs a heuristic to determine when to block and unblock an appropriate number of \procs.