Changeset 2ebcb28

Timestamp:

Jun 30, 2018, 3:56:46 PM (6 years ago)

Author:

Peter A. Buhr <pabuhr@…>

Branches:

ADT, aaron-thesis, arm-eh, ast-experimental, cleanup-dtors, deferred_resn, demangler, enum, forall-pointer-decay, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr, no_list, persistent-indexer, pthread-emulation, qualifiedEnum

Children:

73de175

Parents:

adb60242

Message:

more updates

Location:

doc/papers/concurrency

Files:

• Paper.tex (modified) (6 diffs)
• notes/cor-thread-traits.c (deleted)
• notes/lit-review.md (deleted)
• notes/notes.md (deleted)

doc/papers/concurrency/Paper.tex

@@ -1309 +1309 @@
 void print( Tree & mutex tree ) {                       $\C{// prefix traversal}$
         // write value
-        print( tree->left );                                    $\C{// multiply acquire monitor lock for tree on each recursion}$
-        print( tree->right );
+        print( *tree->left );                                   $\C{// multiply acquire monitor lock for tree on each recursion}$
+        print( *tree->right );
 }
 \end{cfa}
@@ -2089 +2089 @@
 In \CFA, ordering of monitor acquisition relies on memory ordering to prevent deadlock~\cite{Havender68}, because all objects have distinct non-overlapping memory layouts, and mutual-exclusion for a monitor is only defined for its lifetime.
 When a mutex call is made, pointers to the concerned monitors are aggregated into a variable-length array and sorted.
-This array persists for the entire duration of the mutual-exclusion and is used extensively for synchronization operations.
+This array persists for the entire duration of the mutual exclusion and is used extensively for synchronization operations.
 
 To improve performance and simplicity, context switching occurs inside a routine call, so only callee-saved registers are copied onto the stack and then the stack register is switched;
@@ -2170 +2170 @@
 \end{cfa}
 The method used to get time is @clock_gettime( CLOCK_REALTIME )@.
-Each benchmark is performed @N@ times, where @N@ varies depending on the benchmark, the total time is divided by @N@ to obtain the average time for a benchmark.
+Each benchmark is performed @N@ times, where @N@ varies depending on the benchmark;
+the total time is divided by @N@ to obtain the average time for a benchmark.
 All omitted tests for other languages are functionally identical to the shown \CFA test.
 
@@ -2315 +2316 @@
 }
 \end{cfa}
-\captionof{figure}{\CFA Internal scheduling benchmark}
+\captionof{figure}{\CFA Internal-scheduling benchmark}
 \label{f:int-sched}
 
 \centering
-\captionof{table}{Internal scheduling comparison (nanoseconds)}
+\captionof{table}{Internal-scheduling comparison (nanoseconds)}
 \label{tab:int-sched}
 \bigskip
@@ -2366 +2367 @@
 }
 \end{cfa}
-\captionof{figure}{\CFA external scheduling benchmark}
+\captionof{figure}{\CFA external-scheduling benchmark}
 \label{f:ext-sched}
 
 \centering
 
-\captionof{table}{External scheduling comparison (nanoseconds)}
+\captionof{table}{External-scheduling comparison (nanoseconds)}
 \label{tab:ext-sched}
 \bigskip
@@ -2397 +2398 @@
 }
 \end{cfa}
-\captionof{figure}{\CFA object creation benchmark}
+\captionof{figure}{\CFA object-creation benchmark}
 \label{f:creation}