Changes in / [599dc6a:48ee593]

Location:

doc/theses/colby_parsons_MMAth

Files:

• local.bib (modified) (2 diffs)
• text/conclusion.tex (modified) (1 diff)

doc/theses/colby_parsons_MMAth/local.bib

@@ -170 +170 @@
 }
 
-@misc{linux:iouring,
-  author = "Linux man pages",
-  title = "io\_uring(7) - Linux manual page",
-  howpublished = {\href{https://man7.org/linux/man-pages/man7/io\_uring.7.html}},
-  note = "[Online; accessed 23-May-2023]"
-}
-
 @article{Ichbiah79,
   title={Preliminary Ada reference manual},
@@ -195 +188 @@
 }
 
-@misc{openmp,
-  author = "OpenMP",
-  title = "OPENMP API Specification",
-  howpublished = {\href{https://www.openmp.org/spec-html/5.0/openmpch1.html}},
-  note = "[Online; accessed 23-May-2023]"
-}
 
-@techreport{wilson94,
-  title={The suif compiler system: a parallelizing and optimizing research compiler},
-  author={Wilson, Robert and French, Robert and Wilson, Christopher and Amarasinghe, Saman and Anderson, Jennifer and Tjiang, Steve and Liao, Shih-Wei and Tseng, Chau-Wen and Hall, Mary and Lam, Monica and others},
-  year={1994},
-  institution={Stanford University Technical Report No. CSL-TR-94-620}
-}
 
-@misc{haskell:parallel,
-  author = "Haskell Wiki",
-  title = "Parallel Haskell",
-  howpublished = {\href{https://wiki.haskell.org/Parallel}},
-  note = "[Online; accessed 23-May-2023]"
-}
-
-@misc{gcc:atomics,
-  author = "GCC team",
-  title = "Built-in Functions for Memory Model Aware Atomic Operations",
-  howpublished = {\href{https://gcc.gnu.org/onlinedocs/gcc/_005f_005fatomic-Builtins.html}},
-  note = "[Online; accessed 23-May-2023]"
-}
-

doc/theses/colby_parsons_MMAth/text/conclusion.tex

@@ -15 +15 @@
 This thesis scratches the surface of implicit concurrency by providing an actor system.
 There is room for more implicit concurrency tools in \CFA.
-User-defined implicit concurrency in the form of annotated loops or recursive functions exists in many other languages and libraries~\cite{uC++,openmp} and could be implemented and expanded on in \CFA.
-Additionally, the problem of automatic parallelism of sequential programs via the compiler is an interesting research space that other languages have approached~\cite{wilson94,haskell:parallel} that could also be explored in \CFA.
+User-defined implicit concurrency in the form of annotated loops or recursive functions exists in many other languages~\cite{} and could be implemented and expanded on in \CFA.
+Additionally, the problem of automatic parallelism of sequential programs via the compiler is an interesting research space that other languages have approached~\cite{} that could also be explored in \CFA.
 
 
 \subsection{Synchronously Multiplexing System Calls}
-There are many tools that try to sychronize on or asynchronously check I/O, since improvements in this area pay dividends in many areas of computer science~\cite{linux:select,linux:poll,linux:epoll,linux:iouring}.
+There are many tools that try to sychronize on or asynchronously check I/O, since improvements in this area pay dividends in many areas of computer science~\cite{}. %cite all the poll/iouring utilities
 Research on improving user-space tools to synchronize over I/O and other system calls is an interesting area to explore in the world of concurrent tooling.
 
-\subsection{Advanced Actor Stealing Heuristics}
-In this thesis, two basic victim selection heuristics were chosen when implementing the work stealing actor system. Good victim selection is an active area of work stealing research, especially when taking into account NUMA effects and cache locality~\cite{barghi18,wolke17}. The actor system in \CFA is modular and exploration of other victim selection heuristics for queue stealing in \CFA could constitute future work. The other question that arises with work stealing is: When should a worker thread steal? Work stealing systems can often be too aggressive when stealing, causing the cost of the steal to be higher than what is saved by sharing the work. In the presented actor system, a worker thread steals work after it checks all its work queues for work twice and sees them all empty. Given that thief threads often have cycles to spare, there is room for a more nuanced approach to choosing when to steal.
-
-\subsection{Better Atomic Operations}
+\subsection{Better Atomics}
 When writing low level concurrent programs, expecially lock/wait-free programs, low level atomic instructions need to be used.
-In C, the gcc-builtin atomics~\cite{gcc:atomics} are commonly used, but leave much to be desired. 
+In C, the gcc-builtin atomics~\cite{} are commonly used, but leave much to be desired.
 Some of the problems include the following.
 Archaic and opaque macros often have to be used to ensure that atomic assembly is generated instead of locks.