Ignore:
Timestamp:
Jul 4, 2023, 12:42:47 PM (17 months ago)
Author:
caparsons <caparson@…>
Branches:
master
Children:
0ec4eb0
Parents:
5e81a9c
Message:

added conclusion to makefile, removed duplicate bib entry and added conclusion to thesis.tex

Location:
doc/theses/colby_parsons_MMAth
Files:
4 edited

Legend:

Unmodified
Added
Removed

  • doc/theses/colby_parsons_MMAth/Makefile

    r5e81a9c r930a800  
    2323        text/channels \
    2424        text/waituntil \
     25        text/conclusion \
    2526}
    2627

  • doc/theses/colby_parsons_MMAth/local.bib

    r5e81a9c r930a800  
    168168}
    169169
    170 @misc{openmp,
    171   author = "OpenMP",
    172   title = "OPENMP API Specification",
    173   howpublished = {\href{https://www.openmp.org/spec-html/5.0/openmpch1.html}},
    174   note = "[Online; accessed 23-May-2023]"
    175 }
    176 
    177170@techreport{wilson94,
    178171  title={The suif compiler system: a parallelizing and optimizing research compiler},

  • doc/theses/colby_parsons_MMAth/text/conclusion.tex

    r5e81a9c r930a800  
    1515This thesis scratches the surface of implicit concurrency by providing an actor system.
    1616There is room for more implicit concurrency tools in \CFA.
    17 User-defined implicit concurrency in the form of annotated loops or recursive functions exists in many other languages and libraries~\cite{uC++,openmp}. Similar implicit concurrency mechanisms could be implemented and expanded on in \CFA.
     17User-defined implicit concurrency in the form of annotated loops or recursive functions exists in many other languages and libraries~\cite{uC++,OpenMP}. Similar implicit concurrency mechanisms could be implemented and expanded on in \CFA.
    1818Additionally, 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.
    1919
    … …  
    3535All these problems and more could benefit from language support in \CFA.
    3636Adding good language support for atomics is a difficult and nuanced problem, which if solved well would allow for easier and safer writing of low-level concurrent code.
     37

  • doc/theses/colby_parsons_MMAth/thesis.tex

    r5e81a9c r930a800  
    206206\input{waituntil}
    207207
     208\input{conclusion}
     209
    208210%----------------------------------------------------------------------
    209211% END MATERIAL
Note: See TracChangeset for help on using the changeset viewer.