- Timestamp:
- Aug 24, 2020, 1:36:02 PM (4 years ago)
- Branches:
- ADT, arm-eh, ast-experimental, enum, forall-pointer-decay, jacob/cs343-translation, master, new-ast-unique-expr, pthread-emulation, qualifiedEnum
- Children:
- 8d8ac3b, 9509a412
- Parents:
- 97cba9f
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/theses/thierry_delisle_PhD/comp_II/comp_II.tex
r97cba9f r61b1447 44 44 \begin{document} 45 45 \maketitle 46 \thispagestyle{empty} 46 47 \cleardoublepage 47 48 … … 327 328 328 329 How much scalability is actually needed is highly debatable. 329 \emph{libfibre}\cite{libfibre} has compared favorably to other schedulers in webserver tests\cite{ karstenuser} and uses a single atomic counter in its scheduling algorithm similarly to the proposed bitmask.330 \emph{libfibre}\cite{libfibre} has compared favorably to other schedulers in webserver tests\cite{Karsten20} and uses a single atomic counter in its scheduling algorithm similarly to the proposed bitmask. 330 331 As such, the single atomic instruction on a shared cacheline may be sufficiently performant. 331 332 … … 421 422 Processors that are unnecessarily unblocked lead to unnecessary contention, CPU usage, and power consumption, while too many sleeping processors can lead to sub-optimal throughput. 422 423 Furthermore, transitions from sleeping to awake and vice-versa also add unnecessary latency. 423 There is already a wealth of research on the subject\cite{schillings1996engineering, wiki:thunderherd} and I may use an existing approach for the idle-sleep heuristic in this project, \eg\cite{ karstenuser}.424 There is already a wealth of research on the subject\cite{schillings1996engineering, wiki:thunderherd} and I may use an existing approach for the idle-sleep heuristic in this project, \eg\cite{Karsten20}. 424 425 425 426 \subsection{Asynchronous I/O}
Note: See TracChangeset
for help on using the changeset viewer.