@misc{6485, abstract = {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.}, author = {Koval, Nikita and Alistarh, Dan-Adrian and Elizarov, Roman}, booktitle = {Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming}, isbn = {9781450362252}, location = {Washington, NY, United States}, pages = {417--418}, publisher = {ACM Press}, title = {{Lock-free channels for programming via communicating sequential processes}}, doi = {10.1145/3293883.3297000}, year = {2019}, }