Update 2023-12-11-BrilCpp.md

content/blog/2023-12-11-BrilCpp.md

@@ -27,7 +27,7 @@ For overall usability, we implemented part of partial redundancy elimination. We
 
 We found a few memory leaks with our final iteration but our program should still be memory safe.
 
-For runtime performance, we ran the existing `brili` interpreter as well as our own interpreter against the core benchmarks in the course repo. We timed the wall clock runtime of both our interpreter and the existing interpreter over all benchmarks in the folder. We observe that the speedup proportion of our wall clock runtime versus the existing interpreter ranges from a mininum of -0.243 to a maximum of 0.919, with a mean of 0.463 and a standard deviation of 0.342 over the core benchmarks. Overall, we see mostly positive improvement in wall clock runtime over the existing implementation. ![data](https://docs.google.com/spreadsheets/d/1QoUncdD2We8P7KumqAfWIKOdVGDnGZ_klbH5AieZHrQ/edit?usp=sharing).
+For runtime performance, we ran the existing `brili` interpreter as well as our own interpreter against the core benchmarks in the course repo. We timed the wall clock runtime of both our interpreter and the existing interpreter over all benchmarks in the folder. We observe that the speedup proportion of our wall clock runtime versus the existing interpreter ranges from a mininum of -0.243 to a maximum of 0.919, with a mean of 0.463 and a standard deviation of 0.342 over the core benchmarks. Overall, we see mostly positive improvement in wall clock runtime over the existing implementation. ![data](./wallclockproportion.png).