Changeset 0f8b1a7 for doc/theses/colby_parsons_MMAth/text/intro.tex

Timestamp:

Sep 7, 2023, 10:36:06 AM (10 months ago)

Author:

caparsons <caparson@…>

Branches:

master

Children:

3ee8853

Parents:

154672d

Message:

merged in Peter's edits with a few small changes

File:

• doc/theses/colby_parsons_MMAth/text/intro.tex (modified) (3 diffs)

doc/theses/colby_parsons_MMAth/text/intro.tex

@@ -29 +29 @@
 \item Livelock, where threads constantly attempt a concurrent operation unsuccessfully, resulting in no progress being made.
 \item Starvation, where \emph{some} threads constantly attempt a concurrent operation unsuccessfully, resulting in partial progress being made.
-% where some threads may be deprived access to some shared resource due to unfairness and never make progress.
 \item Deadlock, where some threads wait for an event that cannot occur, blocking them indefinitely, resulting in no progress being made.
 \end{enumerate}
-Even with the guiding hand of concurrent tools these pitfalls still catch unwary programmers, but good language support help significantly to prevent, detect, and mitigate these problems.
+Even with the guiding hand of concurrent tools these pitfalls still catch unwary programmers, but good language support helps significantly to prevent, detect, and mitigate these problems.
 
 \section{Thesis Overview}
@@ -38 +37 @@
 Chapter~\ref{s:cfa} of this thesis aims to familiarize the reader with the language \CFA.
 In this chapter, syntax and features of the \CFA language that appear in this work are discussed.
-Chapter~\ref{s:cfa_concurrency} briefly discusses prior concurrency work in \CFA, and how the work in this thesis builds on top of this existing framework.
-Each remaining chapter introduces an additional \CFA concurrent-language feature, which includes discussing prior related work for this feature, extensions over prior features, and using benchmarks to compare the performance this feature with corresponding or similar features in other languages and systems.
+Chapter~\ref{s:cfa_concurrency} briefly discusses prior concurrency work in \CFA, and how the work in this thesis builds on top of the existing framework.
+Each remaining chapter introduces an additional \CFA concurrent-language feature, which includes discussing prior related work for the feature, extensions over prior features, and uses benchmarks to compare the performance the feature with corresponding or similar features in other languages and systems.
 
 Chapter~\ref{s:mutexstmt} discusses the @mutex@ statement, a language feature that provides safe and simple lock usage.
@@ -48 +47 @@
 An actor system is a close cousin of channels, as it also belongs to the message passing paradigm of concurrency.
 However, an actor system provides a greater degree of abstraction and ease of scalability, making it useful for a different range of problems than channels.
-The actor system in \CFA is compared with a variety of other systems on a suite of benchmarks. %, where it achieves significant performance gains over other systems due to its design.
+The actor system in \CFA is compared with a variety of other systems on a suite of benchmarks.
 Chapter~\ref{s:waituntil} discusses the \CFA @waituntil@ statement, which provides the ability to synchronize while waiting for a resource, such as acquiring a lock, accessing a future, or writing to a channel.
 The \CFA @waituntil@ statement provides greater flexibility and expressibility than similar features in other languages.