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