regenerate after: update Dan's talk

lsd-ucsc · Apr 16, 2024 · 811308d · 811308d
1 parent 5ae0c87
commit 811308d
Show file tree

Hide file tree

Showing 3 changed files with 29 additions and 4 deletions.
diff --git a/index.xml b/index.xml
@@ -46,9 +46,9 @@
 &lt;/tr&gt;
 
 &lt;tr&gt;
-&lt;td&gt;April 12&lt;/td&gt;
+&lt;td&gt;&lt;a href=&#34;#april-12&#34;&gt;April 12&lt;/a&gt;&lt;/td&gt;
 &lt;td&gt;Dan Plyukhin&lt;/td&gt;
-&lt;td&gt;&lt;em&gt;TBD&lt;/em&gt;&lt;/td&gt;
+&lt;td&gt;Ozone: Fully Out-of-Order Choreographies&lt;/td&gt;
 &lt;/tr&gt;
 
 &lt;tr&gt;
@@ -125,6 +125,18 @@
 
 &lt;p&gt;He is based in the compiler teams at Arm in Cambridge where he assists engineers with finding bugs and deploying automated concurrency testing as part of an EPSRC grant. Luke&amp;rsquo;s opinions are his own and Arm does not endorse his work.&lt;/p&gt;
 
+&lt;h2 id=&#34;april-12&#34;&gt;April 12&lt;/h2&gt;
+
+&lt;p&gt;&lt;strong&gt;Speaker:&lt;/strong&gt; Dan Plyukhin&lt;/p&gt;
+
+&lt;p&gt;&lt;strong&gt;Title:&lt;/strong&gt; Ozone: Fully Out-of-Order Choreographies&lt;/p&gt;
+
+&lt;p&gt;&lt;strong&gt;Abstract:&lt;/strong&gt; Choreographic programming is a paradigm for writing distributed applications. It allows programmers to write a single program, called a choreography, that can be compiled to generate correct implementations of each process in the application. Although choreographies provide good static guarantees, they can exhibit high latency when messages or processes are delayed. This is because processes in a choreography typically execute in a fixed, deterministic order, and cannot adapt to the order that messages arrive at runtime. In non-choreographic code, programmers can address this problem by allowing processes to execute out of order &amp;ndash; for instance by using futures or reactive programming. However, in choreographic code, out-of-order process execution can lead to serious and subtle bugs, called communication integrity violations (CIVs).&lt;/p&gt;
+
+&lt;p&gt;In this paper, we develop a model of choreographic programming for out-of-order processes that guarantees absence of CIVs and deadlocks. As an application of our approach, we also introduce an API for safe non-blocking communication via futures in the choreographic programming language Choral. The API allows processes to execute out of order, participate in multiple choreographies concurrently, and to handle unordered or dropped messages as in the UDP transport protocol. We provide an illustrative evaluation of our API, showing that out-of-order execution can reduce latency by overlapping communication with computation.&lt;/p&gt;
+
+&lt;p&gt;&lt;strong&gt;Bio:&lt;/strong&gt; Dan works as a postdoc at the University of Southern Denmark and is receiving his PhD from the University of Illinois at Urbana-Champaign (UIUC). He is the author of the UIGC library for Akka, which provides fault-tolerant resource management for distributed actor systems. Dan’s research focuses on making distributed reactive applications easier to write and reason about.&lt;/p&gt;
+
 &lt;hr /&gt;
 
 &lt;p&gt;&lt;a href=&#34;../&#34;&gt;Archive&lt;/a&gt;&lt;/p&gt;

diff --git a/lsd-seminar/2024sp/index.html b/lsd-seminar/2024sp/index.html
@@ -227,9 +227,9 @@ <h1 itemprop="name">Languages, Systems, and Data Seminar (Spring 2024)</h1>
 </tr>
 
 <tr>
-<td>April 12</td>
+<td><a href="#april-12">April 12</a></td>
 <td>Dan Plyukhin</td>
-<td><em>TBD</em></td>
+<td>Ozone: Fully Out-of-Order Choreographies</td>
 </tr>
 
 <tr>
@@ -306,6 +306,18 @@ <h2 id="april-5">April 5</h2>
 
 <p>He is based in the compiler teams at Arm in Cambridge where he assists engineers with finding bugs and deploying automated concurrency testing as part of an EPSRC grant. Luke&rsquo;s opinions are his own and Arm does not endorse his work.</p>
 
+<h2 id="april-12">April 12</h2>
+
+<p><strong>Speaker:</strong> Dan Plyukhin</p>
+
+<p><strong>Title:</strong> Ozone: Fully Out-of-Order Choreographies</p>
+
+<p><strong>Abstract:</strong> Choreographic programming is a paradigm for writing distributed applications. It allows programmers to write a single program, called a choreography, that can be compiled to generate correct implementations of each process in the application. Although choreographies provide good static guarantees, they can exhibit high latency when messages or processes are delayed. This is because processes in a choreography typically execute in a fixed, deterministic order, and cannot adapt to the order that messages arrive at runtime. In non-choreographic code, programmers can address this problem by allowing processes to execute out of order &ndash; for instance by using futures or reactive programming. However, in choreographic code, out-of-order process execution can lead to serious and subtle bugs, called communication integrity violations (CIVs).</p>
+
+<p>In this paper, we develop a model of choreographic programming for out-of-order processes that guarantees absence of CIVs and deadlocks. As an application of our approach, we also introduce an API for safe non-blocking communication via futures in the choreographic programming language Choral. The API allows processes to execute out of order, participate in multiple choreographies concurrently, and to handle unordered or dropped messages as in the UDP transport protocol. We provide an illustrative evaluation of our API, showing that out-of-order execution can reduce latency by overlapping communication with computation.</p>
+
+<p><strong>Bio:</strong> Dan works as a postdoc at the University of Southern Denmark and is receiving his PhD from the University of Illinois at Urbana-Champaign (UIUC). He is the author of the UIGC library for Akka, which provides fault-tolerant resource management for distributed actor systems. Dan’s research focuses on making distributed reactive applications easier to write and reason about.</p>
+
 <hr />
 
 <p><a href="../">Archive</a></p>

diff --git a/themes/academic b/themes/academic