{"status":"public","title":"Brief Announcement: Performance prediction for coarse-grained locking","quality_controlled":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2019-02-13T10:08:19Z","oa":1,"oa_version":"Submitted Version","scopus_import":"1","publisher":"ACM Press","date_published":"2018-07-23T00:00:00Z","publication_status":"published","abstract":[{"text":"A standard design pattern found in many concurrent data structures, such as hash tables or ordered containers, is an alternation of parallelizable sections that incur no data conflicts and critical sections that must run sequentially and are protected with locks. A lock can be viewed as a queue that arbitrates the order in which the critical sections are executed, and a natural question is whether we can use stochastic analysis to predict the resulting throughput. As a preliminary evidence to the affirmative, we describe a simple model that can be used to predict the throughput of coarse-grained lock-based algorithms. We show that our model works well for CLH lock, and we expect it to work for other popular lock designs such as TTAS, MCS, etc.","lang":"eng"}],"main_file_link":[{"url":"https://hal-univ-lyon3.archives-ouvertes.fr/INRIA/hal-01887733v1","open_access":"1"}],"department":[{"_id":"DaAl"}],"day":"23","type":"conference","date_updated":"2023-09-19T10:43:45Z","month":"07","article_processing_charge":"No","isi":1,"year":"2018","citation":{"chicago":"Aksenov, Vitaly, Dan-Adrian Alistarh, and Petr Kuznetsov. “Brief Announcement: Performance Prediction for Coarse-Grained Locking.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, 411–13. ACM Press, 2018. https://doi.org/10.1145/3212734.3212785.","apa":"Aksenov, V., Alistarh, D.-A., & Kuznetsov, P. (2018). Brief Announcement: Performance prediction for coarse-grained locking. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18 (pp. 411–413). Egham, United Kingdom: ACM Press. https://doi.org/10.1145/3212734.3212785","ista":"Aksenov V, Alistarh D-A, Kuznetsov P. 2018. Brief Announcement: Performance prediction for coarse-grained locking. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. PODC: Principles of Distributed Computing, 411–413.","ama":"Aksenov V, Alistarh D-A, Kuznetsov P. Brief Announcement: Performance prediction for coarse-grained locking. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. ACM Press; 2018:411-413. doi:10.1145/3212734.3212785","short":"V. Aksenov, D.-A. Alistarh, P. Kuznetsov, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 411–413.","mla":"Aksenov, Vitaly, et al. “Brief Announcement: Performance Prediction for Coarse-Grained Locking.” Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 411–13, doi:10.1145/3212734.3212785.","ieee":"V. Aksenov, D.-A. Alistarh, and P. Kuznetsov, “Brief Announcement: Performance prediction for coarse-grained locking,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, Egham, United Kingdom, 2018, pp. 411–413."},"conference":{"start_date":"2018-07-23","name":"PODC: Principles of Distributed Computing","end_date":"2018-07-27","location":"Egham, United Kingdom"},"language":[{"iso":"eng"}],"_id":"5964","page":"411-413","doi":"10.1145/3212734.3212785","publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","author":[{"full_name":"Aksenov, Vitaly","last_name":"Aksenov","first_name":"Vitaly"},{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh"},{"full_name":"Kuznetsov, Petr","first_name":"Petr","last_name":"Kuznetsov"}],"publication_identifier":{"isbn":["9781450357951"]},"external_id":{"isi":["000458186900052"]}}