Changeset 878be178 for doc/theses/thierry_delisle_PhD/thesis/text/front.tex

Timestamp:

Aug 5, 2022, 4:13:15 PM (2 years ago)

Author:

Peter A. Buhr <pabuhr@…>

Branches:

ADT, ast-experimental, master, pthread-emulation

Children:

62c5a55, ba48a9b

Parents:

511a9368

Message:

proofread intro

File:

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

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

@@ -129 +129 @@
 which begs of the question of how many kernel threads are needed and should the number be dynamically reevaluated.
 Furthermore, scheduling must prevent kernel threads from blocking, otherwise user-thread parallelism drops.
-When user-threading parallelism does drop, how and when should idle kernel-threads be put to sleep to avoid wasted CPU resources.
+When user-threading parallelism does drop, how and when should idle kernel-threads be put to sleep to avoid wasting CPU resources.
 Finally, the scheduling system must provide fairness to prevent a user thread from monopolizing a kernel thread;
 otherwise other user threads can experience short/long term starvation or kernel threads can deadlock waiting for events to occur on busy kernel threads.
@@ -138 +138 @@
 Fairness is handled through preemption and/or ad-hoc solutions, which leads to coarse-grained fairness with some pathological cases.
 
-After testing and selecting specific approaches to these scheduling issues, a complete implementation was created and tested in the \CFA (C-for-all) runtime system.
+After examining, selecting and testing specific approaches to these scheduling issues, a complete implementation was created and tested in the \CFA (C-for-all) runtime system.
 \CFA is a modern extension of C using user-level threading as its fundamental threading model.
 As one of its primary goals, \CFA aims to offer increased safety and productivity without sacrificing performance.