---
_id: '6485'
abstract:
- lang: eng
  text: 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.
article_processing_charge: No
author:
- first_name: Nikita
  full_name: Koval, Nikita
  id: 2F4DB10C-F248-11E8-B48F-1D18A9856A87
  last_name: Koval
- first_name: Dan-Adrian
  full_name: Alistarh, Dan-Adrian
  id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
  last_name: Alistarh
  orcid: 0000-0003-3650-940X
- first_name: Roman
  full_name: Elizarov, Roman
  last_name: Elizarov
citation:
  ama: Koval N, Alistarh D-A, Elizarov R. <i>Lock-Free Channels for Programming via
    Communicating Sequential Processes</i>. ACM Press; 2019:417-418. doi:<a href="https://doi.org/10.1145/3293883.3297000">10.1145/3293883.3297000</a>
  apa: 'Koval, N., Alistarh, D.-A., &#38; Elizarov, R. (2019). <i>Lock-free channels
    for programming via communicating sequential processes</i>. <i>Proceedings of
    the 24th Symposium on Principles and Practice of Parallel Programming</i> (pp.
    417–418). Washington, NY, United States: ACM Press. <a href="https://doi.org/10.1145/3293883.3297000">https://doi.org/10.1145/3293883.3297000</a>'
  chicago: Koval, Nikita, Dan-Adrian Alistarh, and Roman Elizarov. <i>Lock-Free Channels
    for Programming via Communicating Sequential Processes</i>. <i>Proceedings of
    the 24th Symposium on Principles and Practice of Parallel Programming</i>. ACM
    Press, 2019. <a href="https://doi.org/10.1145/3293883.3297000">https://doi.org/10.1145/3293883.3297000</a>.
  ieee: N. Koval, D.-A. Alistarh, and R. Elizarov, <i>Lock-free channels for programming
    via communicating sequential processes</i>. ACM Press, 2019, pp. 417–418.
  ista: Koval N, Alistarh D-A, Elizarov R. 2019. Lock-free channels for programming
    via communicating sequential processes, ACM Press,p.
  mla: Koval, Nikita, et al. “Lock-Free Channels for Programming via Communicating
    Sequential Processes.” <i>Proceedings of the 24th Symposium on Principles and
    Practice of Parallel Programming</i>, ACM Press, 2019, pp. 417–18, doi:<a href="https://doi.org/10.1145/3293883.3297000">10.1145/3293883.3297000</a>.
  short: N. Koval, D.-A. Alistarh, R. Elizarov, Lock-Free Channels for Programming
    via Communicating Sequential Processes, ACM Press, 2019.
conference:
  end_date: 2019-02-20
  location: Washington, NY, United States
  name: 'PPoPP: Principles and Practice of Parallel Programming'
  start_date: 2019-02-16
date_created: 2019-05-24T10:09:12Z
date_published: 2019-02-01T00:00:00Z
date_updated: 2023-08-25T10:41:20Z
day: '01'
department:
- _id: DaAl
doi: 10.1145/3293883.3297000
external_id:
  isi:
  - '000587604600044'
isi: 1
language:
- iso: eng
month: '02'
oa_version: None
page: 417-418
publication: Proceedings of the 24th Symposium on Principles and Practice of Parallel
  Programming
publication_identifier:
  isbn:
  - '9781450362252'
publication_status: published
publisher: ACM Press
quality_controlled: '1'
status: public
title: Lock-free channels for programming via communicating sequential processes
type: conference_poster
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2019'
...