# Changeset d1b1063 for doc/theses/aaron_moss_PhD

Ignore:
Timestamp:
Feb 28, 2019, 1:42:39 PM (4 years ago)
Branches:
aaron-thesis, arm-eh, cleanup-dtors, enum, forall-pointer-decay, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr, pthread-emulation, qualifiedEnum
Children:
58732d1
Parents:
4eaefd1
Message:

thesis: Add appendix with generic benchmark code

Location:
doc/theses/aaron_moss_PhD/phd
Files:
1 added
3 edited

Unmodified
Added
Removed
• ## doc/theses/aaron_moss_PhD/phd/Makefile

 r4eaefd1 experiments \ conclusion \ generic-bench \ }
• ## doc/theses/aaron_moss_PhD/phd/generic-types.tex

 r4eaefd1 Since all these languages are all C-based and compiled with the same compiler backend, maximal-performance benchmarks should show little runtime variance, differing only in length and clarity of source code. A more illustrative comparison measures the costs of idiomatic usage of each language's features. The code below shows the \CFA{} benchmark tests for a generic stack based on a singly-linked list; the test suite is equivalent for the other other languages. The code below shows the \CFA{} benchmark tests for a generic stack based on a singly-linked list; the test suite is equivalent for the other other languages, code for which is included in Appendix~\ref{generic-bench-app}. The experiment uses element types !int! and !pair(short, char)! and pushes $N = 40M$ elements on a generic stack, copies the stack, clears one of the stacks, and finds the maximum value in the other stack.
• ## doc/theses/aaron_moss_PhD/phd/thesis.tex

 r4eaefd1 % \nocite{*} % APPENDICIES % ----------- \appendix \input{generic-bench} \end{document}
Note: See TracChangeset for help on using the changeset viewer.