source: doc/theses/andrew_beach_MMath/performance.tex @ 0477127

Last change on this file since 0477127 was 0477127, checked in by Andrew Beach <ajbeach@…>, 2 years ago

Andrew MMath: More updates to the performance chapter.

  • Property mode set to 100644
File size: 19.1 KB
4Performance is of secondary importance for most of this project.
5Instead, the focus was to get the features working. The only performance
6requirement is to ensure the tests for correctness run in a reasonable
7amount of time. Hence, a few basic performance tests were performed to
8check this requirement.
10\section{Test Set-Up}
11Tests were run in \CFA, C++, Java and Python.
12In addition there are two sets of tests for \CFA,
13one with termination and one with resumption.
15C++ is the most comparable language because both it and \CFA use the same
16framework, libunwind.
17In fact, the comparison is almost entirely in quality of implementation.
18Specifically, \CFA's EHM has had significantly less time to be optimized and
19does not generate its own assembly. It does have a slight advantage in that
20\Cpp has to do some extra bookkeeping to support its utility functions,
21but otherwise \Cpp should have a significant advantage.
23Java, a popular language with similar termination semantics,
24is implemented in a very different environment, a virtual machine with
25garbage collection.
26It also implements the finally clause on try blocks allowing for a direct
27feature-to-feature comparison.
28As with \Cpp, Java's implementation is mature, has more optimizations
29and extra features as compared to \CFA.
31Python is used as an alternative comparison because of the \CFA EHM's
32current performance goals, which is to not be prohibitively slow while the
33features are designed and examined. Python has similar performance goals for
34creating quick scripts and its wide use suggests it has achieved those goals.
36Unfortunately, there are no notable modern programming languages with
37resumption exceptions. Even the older programming languages with resumption
38seem to be notable only for having resumption.
39Instead, resumption is compared to its simulation in other programming
40languages: fixup functions that are explicitly passed into a function.
42All tests are run inside a main loop that repeatedly performs a test.
43This approach avoids start-up or tear-down time from
44affecting the timing results.
45The number of times the loop is run is configurable from the command line;
46the number used in the timing runs is given with the results per test.
47The Java tests run the main loop 1000 times before
48beginning the actual test to ``warm-up" the JVM.
49% All other languages are precompiled or interpreted.
51Timing is done internally, with time measured immediately before and
52after the test loop. The difference is calculated and printed.
53The loop structure and internal timing means it is impossible to test
54unhandled exceptions in \Cpp and Java as that would cause the process to
56Luckily, performance on the ``give-up and kill the process" path is not
59The exceptions used in these tests are always based off of
60the base exception for the language.
61This requirement minimizes performance differences based
62on the object model used to represent the exception.
64All tests are designed to be as minimal as possible, while still preventing
65excessive optimizations.
66For example, empty inline assembly blocks are used in \CFA and \Cpp to
67prevent excessive optimizations while adding no actual work.
69% We don't use catch-alls but if we did:
70% Catch-alls are done by catching the root exception type (not using \Cpp's
71% \code{C++}{catch(...)}).
73When collecting data, each test is run eleven times. The top three and bottom
74three results are discarded and the remaining five values are averaged.
75The test are run with the latest (still pre-release) \CFA compiler,
76using gcc-10 as a backend.
77g++-10 is used for \Cpp.
78Java tests are complied and run with version 11.0.11.
79Python used version 3.8.
80The machines used to run the tests are:
81\todo{Get patch versions for python, gcc and g++.}
83\item ARM 2280 Kunpeng 920 48-core 2$\times$socket
84      \lstinline{@} 2.6 GHz running Linux v5.11.0-25
85\item AMD 6380 Abu Dhabi 16-core 4$\times$socket
86      \lstinline{@} 2.5 GHz running Linux v5.11.0-25
88Representing the two major families of hardware architecture.
91The following tests were selected to test the performance of different
92components of the exception system.
93They should provide a guide as to where the EHM's costs are found.
95\paragraph{Stack Traversal}
96This group measures the cost of traversing the stack,
97(and in termination, unwinding it).
98Inside the main loop is a call to a recursive function.
99This function calls itself F times before raising an exception.
100F is configurable from the command line, but is usually 100.
101This builds up many stack frames, and any contents they may have,
102before the raise.
103The exception is always handled at the base of the stack.
104For example the Empty test for \CFA resumption looks like:
106void unwind_empty(unsigned int frames) {
107        if (frames) {
108                unwind_empty(frames - 1);
109        } else {
110                throwResume (empty_exception){&empty_vt};
111        }
114Other test cases have additional code around the recursive call adding
115something besides simple stack frames to the stack.
116Note that both termination and resumption have to traverse over
117the stack but only termination has to unwind it.
119% \item None:
120% Reuses the empty test code (see below) except that the number of frames
121% is set to 0 (this is the only test for which the number of frames is not
122% 100). This isolates the start-up and shut-down time of a throw.
123\item Empty:
124The repeating function is empty except for the necessary control code.
125As other traversal tests add to this, it is the baseline for the group
126as the cost comes from traversing over and unwinding a stack frame
127that has no other interactions with the exception system.
128\item Destructor:
129The repeating function creates an object with a destructor before calling
131Comparing this to the empty test gives the time to traverse over and
132unwind a destructor.
133\item Finally:
134The repeating function calls itself inside a try block with a finally clause
136Comparing this to the empty test gives the time to traverse over and
137unwind a finally clause.
138\item Other Handler:
139The repeating function calls itself inside a try block with a handler that
140does not match the raised exception, but is of the same kind of handler.
141This means that the EHM has to check each handler, and continue
142over all of them until it reaches the base of the stack.
143Comparing this to the empty test gives the time to traverse over and
144unwind a handler.
147\paragraph{Cross Try Statement}
148This group of tests measures the cost for setting up exception handling,
149if it is
150not used (because the exceptional case did not occur).
151Tests repeatedly cross (enter, execute and leave) a try statement but never
152perform a raise.
154\item Handler:
155The try statement has a handler (of the appropriate kind).
156\item Finally:
157The try statement has a finally clause.
160\paragraph{Conditional Matching}
161This group measures the cost of conditional matching.
162Only \CFA implements the language level conditional match,
163the other languages mimic it with an ``unconditional" match (it still
164checks the exception's type) and conditional re-raise if it is not supposed
165to handle that exception.
167Here is the pattern shown in \CFA and \Cpp. Java and Python use the same
168pattern as \Cpp, but with their own syntax.
172try {
173        ...
174} catch (exception_t * e ;
175                should_catch(e)) {
176        ...
182try {
183        ...
184} catch (std::exception & e) {
185        if (!should_catch(e)) throw;
186        ...
191\item Match All:
192The condition is always true. (Always matches or never re-raises.)
193\item Match None:
194The condition is always false. (Never matches or always re-raises.)
197\paragraph{Resumption Simulation}
198A slightly altered version of the Empty Traversal test is used when comparing
199resumption to fix-up routines.
200The handler, the actual resumption handler or the fix-up routine,
201always captures a variable at the base of the loop,
202and receives a reference to a variable at the raise site, either as a
203field on the exception or an argument to the fix-up routine.
204% I don't actually know why that is here but not anywhere else.
206%\section{Cost in Size}
207%Using exceptions also has a cost in the size of the executable.
208%Although it is sometimes ignored
210%There is a size cost to defining a personality function but the later problem
211%is the LSDA which will be generated for every function.
213%(I haven't actually figured out how to compare this, probably using something
214%related to -fexceptions.)
217% First, introduce the tables.
221show the test results.
222In cases where a feature is not supported by a language, the test is skipped
223for that language and the result is marked N/A.
224There are also cases where the feature is supported but measuring its
225cost is impossible. This happened with Java, which uses a JIT that optimize
226away the tests and it cannot be stopped.\cite{Dice21}
227These tests are marked N/C.
228To get results in a consistent range (1 second to 1 minute is ideal,
229going higher is better than going low) N, the number of iterations of the
230main loop in each test, is varied between tests. It is also given in the
231results and has a value in the millions.
233An anomaly in some results came from \CFA's use of gcc nested functions.
234These nested functions are used to create closures that can access stack
235variables in their lexical scope.
236However, if they do so, then they can cause the benchmark's run-time to
237increase by an order of magnitude.
238The simplest solution is to make those values global variables instead
239of function local variables.
240% Do we know if editing a global inside nested function is a problem?
241Tests that had to be modified to avoid this problem have been marked
242with a ``*'' in the results.
244% Now come the tables themselves:
245% You might need a wider window for this.
249\caption{Termination Performance Results (sec)}
251\begin{tabular}{|r|*{2}{|r r r r|}}
253                       & \multicolumn{4}{c||}{AMD}         & \multicolumn{4}{c|}{ARM}  \\
255N\hspace{8pt}          & \multicolumn{1}{c}{\CFA} & \multicolumn{1}{c}{\Cpp} & \multicolumn{1}{c}{Java} & \multicolumn{1}{c||}{Python} &
256                         \multicolumn{1}{c}{\CFA} & \multicolumn{1}{c}{\Cpp} & \multicolumn{1}{c}{Java} & \multicolumn{1}{c|}{Python} \\
258Empty Traversal (1M)   & 3.4   & 2.8   & 18.3  & 23.4      & 3.7   & 3.2   & 15.5  & 14.8  \\
259D'tor Traversal (1M)   & 48.4  & 23.6  & N/A   & N/A       & 64.2  & 29.0  & N/A   & N/A   \\
260Finally Traversal (1M) & 3.4*  & N/A   & 17.9  & 29.0      & 4.1*  & N/A   & 15.6  & 19.0  \\
261Other Traversal (1M)   & 3.6*  & 23.2  & 18.2  & 32.7      & 4.0*  & 24.5  & 15.5  & 21.4  \\
262Cross Handler (100M)   & 6.0   & 0.9   & N/C   & 37.4      & 10.0  & 0.8   & N/C   & 32.2  \\
263Cross Finally (100M)   & 0.9   & N/A   & N/C   & 44.1      & 0.8   & N/A   & N/C   & 37.3  \\
264Match All (10M)        & 32.9  & 20.7  & 13.4  & 4.9       & 36.2  & 24.5  & 12.0  & 3.1   \\
265Match None (10M)       & 32.7  & 50.3  & 11.0  & 5.1       & 36.3  & 71.9  & 12.3  & 4.2   \\
272\caption{Resumption Performance Results (sec)}
277                        & AMD     & ARM  \\
279Empty Traversal (10M)   & 0.2     & 0.3  \\
280D'tor Traversal (10M)   & 1.8     & 1.0  \\
281Finally Traversal (10M) & 1.7     & 1.0  \\
282Other Traversal (10M)   & 22.6    & 25.9 \\
283Cross Handler (100M)    & 8.4     & 11.9 \\
284Match All (100M)        & 2.3     & 3.2  \\
285Match None (100M)       & 2.9     & 3.9  \\
293\caption{Resumption/Fixup Routine Comparison (sec)}
296\begin{tabular}{|r|*{2}{|r r r r r|}}
298            & \multicolumn{5}{c||}{AMD}     & \multicolumn{5}{c|}{ARM}  \\
300N\hspace{8pt}       & \multicolumn{1}{c}{Raise} & \multicolumn{1}{c}{\CFA} & \multicolumn{1}{c}{\Cpp} & \multicolumn{1}{c}{Java} & \multicolumn{1}{c||}{Python} &
301              \multicolumn{1}{c}{Raise} & \multicolumn{1}{c}{\CFA} & \multicolumn{1}{c}{\Cpp} & \multicolumn{1}{c}{Java} & \multicolumn{1}{c|}{Python} \\
303Resume Empty (10M)  & 1.5 & 1.5 & 14.7 & 2.3 & 176.1  & 1.0 & 1.4 & 8.9 & 1.2 & 119.9 \\
308% Now discuss the results in the tables.
309One result not directly related to \CFA but important to keep in mind is that,
310for exceptions, the standard intuition about which languages should go
311faster often does not hold.
312For example, there are a few cases where Python out-performs
313\CFA, \Cpp and Java.
314\todo{Make sure there are still cases where Python wins.}
315The most likely explanation is that, since exceptions
316are rarely considered to be the common case, the more optimized languages
317make that case expensive to improve other cases.
318In addition, languages with high-level representations have a much
319easier time scanning the stack as there is less to decode.
321As stated,
322the performance tests are not attempting to show \CFA has a new competitive
323way of implementing exception handling.
324The only performance requirement is to insure the \CFA EHM has reasonable
325performance for prototyping.
326Although that may be hard to exactly quantify, I believe it has succeeded
327in that regard.
328Details on the different test cases follow.
330\subsection{Termination \texorpdfstring{(\autoref{t:PerformanceTermination})}{}}
333\item[Empty Traversal]
334\CFA is slower than \Cpp, but is still faster than the other languages
335and closer to \Cpp than other languages.
336This result is to be expected,
337as \CFA is closer to \Cpp than the other languages.
339\item[D'tor Traversal]
340Running destructors causes a huge slowdown in the two languages that support
341them. \CFA has a higher proportionate slowdown but it is similar to \Cpp's.
342Considering the amount of work done in destructors is effectively zero
343(an assembly comment), the cost
344must come from the change of context required to run the destructor.
346\item[Finally Traversal]
347Performance is similar to Empty Traversal in all languages that support finally
348clauses. Only Python seems to have a larger than random noise change in
349its run-time and it is still not large.
350Despite the similarity between finally clauses and destructors,
351finally clauses seem to avoid the spike that run-time destructors have.
352Possibly some optimization removes the cost of changing contexts.
353\todo{OK, I think the finally clause may have been optimized out.}
355\item[Other Traversal]
356For \Cpp, stopping to check if a handler applies seems to be about as
357expensive as stopping to run a destructor.
358This results in a significant jump.
360Other languages experience a small increase in run-time.
361The small increase likely comes from running the checks,
362but they could avoid the spike by not having the same kind of overhead for
363switching to the check's context.
364\todo{Could revisit Other Traversal, after Finally Traversal.}
366\item[Cross Handler]
367Here \CFA falls behind \Cpp by a much more significant margin.
368This is likely due to the fact \CFA has to insert two extra function
369calls, while \Cpp does not have to do execute any other instructions.
370Python is much further behind.
372\item[Cross Finally]
373\CFA's performance now matches \Cpp's from Cross Handler.
374If the code from the finally clause is being inlined,
375which is just an asm comment, than there are no additional instructions
376to execute again when exiting the try statement normally.
378\item[Conditional Match]
379Both of the conditional matching tests can be considered on their own.
380However for evaluating the value of conditional matching itself, the
381comparison of the two sets of results is useful.
382Consider the massive jump in run-time for \Cpp going from match all to match
383none, which none of the other languages have.
384Some strange interaction is causing run-time to more than double for doing
385twice as many raises.
386Java and Python avoid this problem and have similar run-time for both tests,
387possibly through resource reuse or their program representation.
388However \CFA is built like \Cpp and avoids the problem as well, this matches
389the pattern of the conditional match, which makes the two execution paths
390very similar.
394\subsection{Resumption \texorpdfstring{(\autoref{t:PerformanceResumption})}{}}
396Moving on to resumption, there is one general note,
397resumption is \textit{fast}. The only test where it fell
398behind termination is Cross Handler.
399In every other case, the number of iterations had to be increased by a
400factor of 10 to get the run-time in an appropriate range
401and in some cases resumption still took less time.
403% I tried \paragraph and \subparagraph, maybe if I could adjust spacing
404% between paragraphs those would work.
406\item[Empty Traversal]
407See above for the general speed-up notes.
408This result is not surprising as resumption's linked-list approach
409means that traversing over stack frames without a resumption handler is
412\item[D'tor Traversal]
413Resumption does have the same spike in run-time that termination has.
414The run-time is actually very similar to Finally Traversal.
415As resumption does not unwind the stack, both destructors and finally
416clauses are run while walking down the stack during the recursive returns.
417So it follows their performance is similar.
419\item[Finally Traversal]
420Same as D'tor Traversal,
421except termination did not have a spike in run-time on this test case.
423\item[Other Traversal]
424Traversing across handlers reduces resumption's advantage as it actually
425has to stop and check each one.
426Resumption still came out ahead (adjusting for iterations) but by much less
427than the other cases.
429\item[Cross Handler]
430The only test case where resumption could not keep up with termination,
431although the difference is not as significant as many other cases.
432It is simply a matter of where the costs come from,
433both termination and resumption have some work to set-up or tear-down a
434handler. It just so happens that resumption's work is slightly slower.
436\item[Conditional Match]
437Resumption shows a slight slowdown if the exception is not matched
438by the first handler, which follows from the fact the second handler now has
439to be checked. However the difference is not large.
443\subsection{Resumption/Fixup \texorpdfstring{(\autoref{t:PerformanceFixupRoutines})}{}}
445Finally are the results of the resumption/fixup routine comparison.
446These results are surprisingly varied. It is possible that creating a closure
447has more to do with performance than passing the argument through layers of
449At 100 stack frames, resumption and manual fixup routines have similar
450performance in \CFA.
451More experiments could try to tease out the exact trade-offs,
452but the prototype's only performance goal is to be reasonable.
453It has already in that range, and \CFA's fixup routine simulation is
454one of the faster simulations as well.
455Plus exceptions add features and remove syntactic overhead,
456so even at similar performance resumptions have advantages
457over fixup routines.
Note: See TracBrowser for help on using the repository browser.