Changeset 70f97c8 for doc/theses

Timestamp:

Jul 3, 2023, 1:12:51 PM (2 years ago)

Author:

caparsons <caparson@…>

Branches:

master

Children:

96ea77a

Parents:

00b046f (diff), 1ae3ac46 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.

Message:

Merge branch 'master' of plg.uwaterloo.ca:software/cfa/cfa-cc

Location:

doc/theses/colby_parsons_MMAth

Files:

• Makefile (modified) (2 diffs)
• glossary.tex (modified) (1 diff)
• local.bib (modified) (1 diff)
• text/channels.tex (modified) (4 diffs)

doc/theses/colby_parsons_MMAth/Makefile

@@ -6 +6 @@
 TeXLIB = .:style:text:${Macros}:${Build}:../../bibliography:
 LaTeX  = TEXINPUTS=${TeXLIB} && export TEXINPUTS && latex -halt-on-error -output-directory=${Build}
-BibTeX = BIBINPUTS=${TeXLIB} && export BIBINPUTS && bibtex -terse
+BibTeX = BIBINPUTS=${TeXLIB} && export BIBINPUTS && bibtex
 
 MAKEFLAGS = --no-print-directory --silent #
@@ -117 +117 @@
         # Must have *.aux file containing citations for bibtex
         if [ ! -r ${basename $@}.aux ] ; then ${LaTeX} ${basename $@}.tex ; fi
-        -${BibTeX} ${Build}/${basename $@}
+        ${BibTeX} ${Build}/${basename $@}
         # Some citations reference others so run again to resolve these citations
 #       ${LaTeX} ${basename $@}.tex

doc/theses/colby_parsons_MMAth/glossary.tex

@@ -35 +35 @@
 \newabbreviation{rtti}{RTTI}{\Newterm{run-time type information}}
 \newabbreviation{fcfs}{FCFS}{\Newterm{first-come first-served}}
+\newabbreviation{lifo}{LIFO}{\Newterm{last-in first-out}}
+\newabbreviation{fifo}{FIFO}{\Newterm{first-in first-out}}
 \newabbreviation{toctou}{TOCTOU}{\Newterm{time-of-check to time-of-use}}
 

doc/theses/colby_parsons_MMAth/local.bib

@@ -27 +27 @@
   pages={11--20},
   year={2017}
-}
-
-@phdthesis{Delisle22,
-author={{Delisle, Thierry}},
-title={The \textsf{C}$\mathbf{\forall}$ Scheduler},
-year={2022},
-publisher="UWSpace",
-url={http://hdl.handle.net/10012/18941}
-}
-
-@article{Hoare78,
-  title={Communicating sequential processes},
-  author={Hoare, Charles Antony Richard},
-  journal={Communications of the ACM},
-  volume={21},
-  number={8},
-  pages={666--677},
-  year={1978},
-  publisher={ACM New York, NY, USA}
-}
-
-@mastersthesis{Beach21,
-author={{Beach, Andrew James}},
-title={Exception Handling in \textsf{C}$\mathbf{\forall}$},
-year={2021},
-publisher="UWSpace",
-url={http://hdl.handle.net/10012/17617}
 }
 

doc/theses/colby_parsons_MMAth/text/channels.tex

@@ -9 +9 @@
 This model is an alternative to shared-memory concurrency, where threads communicate directly by changing shared state.
 
-Channels were first introduced by Kahn~\cite{Kahn74} and extended by Hoare~\cite{Hoare78} (CSP).
+Channels were first introduced by Kahn~\cite{Kahn74} and extended by Hoare~\cite{CSP} (CSP).
 Both papers present a pseudo (unimplemented) concurrent language where processes communicate using input/output channels to send data.
 Both languages are highly restrictive.
@@ -47 +47 @@
 
 In general, the order values are processed by the consumer does not affect the correctness of the producer-consumer problem.
-For example, the buffer can be LIFO, FIFO, or prioritized with respect to insertion and removal.
+For example, the buffer can be \gls{lifo}, \gls{fifo}, or prioritized with respect to insertion and removal.
 However, like MX, a buffer should ensure every value is eventually removed after some reasonable bounded time (no long-term starvation).
 The simplest way to prevent starvation is to implement the buffer as a queue, either with a cyclic array or linked nodes.
@@ -53 +53 @@
 \section{First-Come First-Served}
 As pointed out, a bounded buffer requires MX among multiple producers or consumers.
-This MX should be fair among threads, independent of the FIFO buffer being fair among values.
+This MX should be fair among threads, independent of the \gls{fifo} buffer being fair among values.
 Fairness among threads is called \gls{fcfs} and was defined by Lamport~\cite[p.~454]{Lamport74}.
 \gls{fcfs} is defined in relation to a doorway~\cite[p.~330]{Lamport86II}, which is the point at which an ordering among threads can be established.
@@ -68 +68 @@
 Currently, only the Go programming language provides user-level threading where the primary communication mechanism is channels.
 Experiments were conducted that varied the producer-consumer algorithm and lock type used inside the channel.
-With the exception of non-\gls{fcfs} or non-FIFO algorithms, no algorithm or lock usage in the channel implementation was found to be consistently more performant that Go's choice of algorithm and lock implementation.
+With the exception of non-\gls{fcfs} or non-\gls{fifo} algorithms, no algorithm or lock usage in the channel implementation was found to be consistently more performant that Go's choice of algorithm and lock implementation.
 Performance of channels can be improved by sharding the underlying buffer \cite{Dice11}. 
-However, the FIFO property is lost, which is undesirable for user-facing channels.
+However, the \gls{fifo} property is lost, which is undesirable for user-facing channels.
 Therefore, the low-level channel implementation in \CFA is largely copied from the Go implementation, but adapted to the \CFA type and runtime systems.
 As such the research contributions added by \CFA's channel implementation lie in the realm of safety and productivity features.