Changeset 2e7a299


Ignore:
Timestamp:
Aug 1, 2023, 10:01:32 PM (16 months ago)
Author:
Peter A. Buhr <pabuhr@…>
Branches:
master
Children:
afb3d68
Parents:
9171456b
Message:

change code listing to figure

File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/theses/colby_parsons_MMAth/text/mutex_stmt.tex

    r9171456b r2e7a299  
    350350
    351351The benchmark used to evaluate the avoidance algorithms repeatedly acquires a fixed number of locks in a random order and then releases them.
    352 The pseudocode for the deadlock avoidance benchmark is shown in \VRef[Listing]{l:deadlock_avoid_pseudo}.
     352The pseudocode for the deadlock avoidance benchmark is shown in \VRef[Figure]{l:deadlock_avoid_pseudo}.
    353353To ensure the comparison exercises the implementation of each lock avoidance algorithm, an identical spinlock is implemented in each language using a set of builtin atomics available in both \CC and \CFA.
    354354The benchmarks are run for a fixed duration of 10 seconds and then terminate.
     
    357357The median is calculated and is plotted alongside the 95\% confidence intervals for each point.
    358358
    359 \begin{cfa}[caption={Deadlock avoidance benchmark pseudocode},label={l:deadlock_avoid_pseudo}]
    360 
     359\begin{figure}
     360\begin{cfa}
    361361size_t n_locks; $\C{// number of locks}$
    362362size_t n_thds; $\C{// number of threads}$
     
    387387    printf( "%lu\n", total );
    388388}
    389 
    390 \end{cfa}
     389\end{cfa}
     390\caption{Deadlock avoidance benchmark pseudocode}
     391\label{l:deadlock_avoid_pseudo}
     392\end{figure}
    391393
    392394The performance experiments were run on the following multi-core hardware systems to determine differences across platforms:
Note: See TracChangeset for help on using the changeset viewer.