<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>thesis</genre>

<titleInfo><title>Lock-free channels for programming via communicating sequential processes</title></titleInfo>


<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Nikita</namePart>
  <namePart type="family">Koval</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">2F4DB10C-F248-11E8-B48F-1D18A9856A87</identifier></name>
<name type="personal">
  <namePart type="given">Dan-Adrian</namePart>
  <namePart type="family">Alistarh</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">4A899BFC-F248-11E8-B48F-1D18A9856A87</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0003-3650-940X</description></name>
<name type="personal">
  <namePart type="given">Roman</namePart>
  <namePart type="family">Elizarov</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">DaAl</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>



<name type="conference">
  <namePart>PPoPP: Principles and Practice of Parallel Programming</namePart>
</name>






<abstract lang="eng">Traditional concurrent programming involves manipulating shared mutable state. Alternatives to this programming style are communicating sequential processes (CSP) [1] and actor [2] models, which share data via explicit communication. Rendezvous channelis the common abstraction for communication between several processes, where senders and receivers perform a rendezvous handshake as a part of their protocol (senders wait for receivers and vice versa). Additionally to this, channels support the select expression. In this work, we present the first efficient lock-free channel algorithm, and compare it against Go [3] and Kotlin [4] baseline implementations.</abstract>

<originInfo><publisher>ACM</publisher><dateIssued encoding="w3cdtf">2019</dateIssued><place><placeTerm type="text">Washington, NY, United States</placeTerm></place>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming</title></titleInfo>
  <identifier type="isbn">9781450362252</identifier>
  <identifier type="ISI">000587604600044</identifier><identifier type="doi">10.1145/3293883.3297000</identifier>
<part><extent unit="pages">417-418</extent>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<short>N. Koval, D.-A. Alistarh, R. Elizarov, Lock-Free Channels for Programming via Communicating Sequential Processes, ACM, 2019.</short>
<ieee>N. Koval, D.-A. Alistarh, and R. Elizarov, &lt;i&gt;Lock-free channels for programming via communicating sequential processes&lt;/i&gt;. ACM, 2019, pp. 417–418.</ieee>
<chicago>Koval, Nikita, Dan-Adrian Alistarh, and Roman Elizarov. &lt;i&gt;Lock-Free Channels for Programming via Communicating Sequential Processes&lt;/i&gt;. &lt;i&gt;Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming&lt;/i&gt;. ACM, 2019. &lt;a href=&quot;https://doi.org/10.1145/3293883.3297000&quot;&gt;https://doi.org/10.1145/3293883.3297000&lt;/a&gt;.</chicago>
<mla>Koval, Nikita, et al. “Lock-Free Channels for Programming via Communicating Sequential Processes.” &lt;i&gt;Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming&lt;/i&gt;, ACM, 2019, pp. 417–18, doi:&lt;a href=&quot;https://doi.org/10.1145/3293883.3297000&quot;&gt;10.1145/3293883.3297000&lt;/a&gt;.</mla>
<ama>Koval N, Alistarh D-A, Elizarov R. &lt;i&gt;Lock-Free Channels for Programming via Communicating Sequential Processes&lt;/i&gt;. ACM; 2019:417-418. doi:&lt;a href=&quot;https://doi.org/10.1145/3293883.3297000&quot;&gt;10.1145/3293883.3297000&lt;/a&gt;</ama>
<ista>Koval N, Alistarh D-A, Elizarov R. 2019. Lock-free channels for programming via communicating sequential processes, ACM,p.</ista>
<apa>Koval, N., Alistarh, D.-A., &amp;#38; Elizarov, R. (2019). &lt;i&gt;Lock-free channels for programming via communicating sequential processes&lt;/i&gt;. &lt;i&gt;Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming&lt;/i&gt; (pp. 417–418). Washington, NY, United States: ACM. &lt;a href=&quot;https://doi.org/10.1145/3293883.3297000&quot;&gt;https://doi.org/10.1145/3293883.3297000&lt;/a&gt;</apa>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>6485</recordIdentifier><recordCreationDate encoding="w3cdtf">2019-05-24T10:09:12Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2024-12-11T11:42:22Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
