{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T05:08:21Z","timestamp":1745989701101,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030670863"},{"type":"electronic","value":"9783030670870"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-67087-0_13","type":"book-chapter","created":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T01:17:39Z","timestamp":1610587059000},"page":"192-208","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Fissile Locks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9164-7747","authenticated-orcid":false,"given":"Dave","family":"Dice","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4419-4340","authenticated-orcid":false,"given":"Alex","family":"Kogan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,14]]},"reference":[{"key":"13_CR1","unstructured":"Go runtime : mutex implementation (2020). https:\/\/github.com\/golang\/go\/blob\/master\/src\/sync\/mutex.go"},{"key":"13_CR2","unstructured":"Aksenov, V., Alistarh, D., Kuznetsov, P.: Brief announcement: performance prediction for coarse-grained locking. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing. PODC 2018 (2018). http:\/\/doi.acm.org\/10.1145\/3212734.3212785"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Anderson, T.E.: The performance of spin lock alternatives for shared-money multiprocessors. IEEE Transactions on Parallel and Distributed Systems (1990)","DOI":"10.1109\/71.80120"},{"key":"13_CR4","unstructured":"Anti\u0107, J., Chatzopoulos, G., Guerraoui, R., Trigonakis, V.: Locking made easy. In: Proceedings of the 17th International Middleware Conference. Middleware 2016 (2016). http:\/\/doi.acm.org\/10.1145\/2988336.2988357"},{"key":"13_CR5","unstructured":"Boyd-Wickizer, S., Kaashoek, M.F., Morris, R., Zeldovich, N.: Non-scalable locks are dangerous. Ottawa Linux Symposium (OLS) (2012). https:\/\/www.kernel.org\/doc\/ols\/2012\/ols2012-zeldovich.pdf"},{"key":"13_CR6","unstructured":"Bueso, D.: Scalability techniques for practical synchronization primitives. Commun. ACM (2014). http:\/\/doi.acm.org\/10.1145\/2687882"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Chabbi, M., Fagan, M., Mellor-Crummey, J.: High performance locks for multi-level numa systems. Association for Computing Machinery (2015). https:\/\/doi.org\/10.1145\/2688500.2688503","DOI":"10.1145\/2688500.2688503"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Chabbi, M., Mellor-Crummey, J.: Contention-conscious, locality-preserving locks. Association for Computing Machinery (2016). https:\/\/doi.org\/10.1145\/2851141.2851166","DOI":"10.1145\/2851141.2851166"},{"key":"13_CR9","unstructured":"Corbet, J.: MCS locks and qspinlocks, 11 March 2014. https:\/\/lwn.net\/Articles\/590243. Accessed 12 Sept 2018"},{"key":"13_CR10","unstructured":"Craig, T.: Building fifo and priority-queueing spin locks from atomic swap (1993)"},{"key":"13_CR11","unstructured":"David, T., Guerraoui, R., Trigonakis, V.: Everything you always wanted to know about synchronization but were afraid to ask. In: Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles. SOSP 2013 (2013). http:\/\/doi.acm.org\/10.1145\/2517349.2522714"},{"key":"13_CR12","unstructured":"Dice, D.: Malthusian locks. CoRR abs\/1511.06035 (2015). http:\/\/arxiv.org\/abs\/1511.06035"},{"key":"13_CR13","unstructured":"Dice, D., Kogan, A.: TWA - ticket locks augmented with a waiting array. CoRR abs\/1810.01573 (2018). http:\/\/arxiv.org\/abs\/1810.01573"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-030-29400-7_26","volume-title":"Euro-Par 2019: Parallel Processing","author":"D Dice","year":"2019","unstructured":"Dice, D., Kogan, A.: Avoiding scalability collapse by restricting concurrency. In: Yahyapour, R. (ed.) Euro-Par 2019. LNCS, vol. 11725, pp. 363\u2013376. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29400-7_26"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Dice, D., Kogan, A.: Compact numa-aware locks. Association for Computing Machinery (2019). https:\/\/doi.org\/10.1145\/3302424.3303984","DOI":"10.1145\/3302424.3303984"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Dice, D., Marathe, V.J., Shavit, N.: Lock cohorting: A general technique for designing numa locks. Association for Computing Machinery (2012). https:\/\/doi.org\/10.1145\/2145816.2145848","DOI":"10.1145\/2145816.2145848"},{"key":"13_CR17","unstructured":"Dice, D., Marathe, V.J., Shavit, N.: Lock cohorting: A general technique for designing numa locks. ACM Trans. Parallel Comput. (2015). http:\/\/doi.acm.org\/10.1145\/2686884"},{"key":"13_CR18","unstructured":"Eyerman, S., Eeckhout, L.: Modeling critical sections in amdahl\u2019s law and its implications for multicore design. In: Proceedings of the 37th Annual International Symposium on Computer Architecture. ISCA 2010 (2010). http:\/\/doi.acm.org\/10.1145\/1815961.1816011"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Guiroux, H., Lachaize, R., Qu\u00e9ma, V., Trigonakis, V.: Lock-unlock: Is that all? a pragmatic analysis of locking in software systems (2019). https:\/\/doi.org\/10.1145\/3301501","DOI":"10.1145\/3301501"},{"key":"13_CR20","unstructured":"Guiroux, H., Lachaize, R., Qu\u00e9ma, V.: Multicore locks: the case is not closed yet. In: 2016 USENIX Annual Technical Conference (USENIX ATC 16). USENIX Association (2016). https:\/\/www.usenix.org\/conference\/atc16\/technical-sessions\/presentation\/guiroux"},{"key":"13_CR21","unstructured":"Ha, P.H., Papatriantafilou, M., Tsigas, P.: Reactive spin-locks: a self-tuning approach. In: 8th International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN 2005) (2005)"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Jayanti, P., Jayanti, S., Jayanti, S.: Towards an ideal queue lock. In: Proceedings of the 21st International Conference on Distributed Computing and Networking. ICDCN 2020, Association for Computing Machinery (2020). https:\/\/doi.org\/10.1145\/3369740.3369784","DOI":"10.1145\/3369740.3369784"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Kashyap, S., Calciu, I., Cheng, X., Min, C., Kim, T.: Scalable and practical locking with shuffling. In: Proceedings of the 27th ACM Symposium on Operating Systems Principles. SOSP 2019, Association for Computing Machinery (2019). https:\/\/doi.org\/10.1145\/3341301.3359629","DOI":"10.1145\/3341301.3359629"},{"key":"13_CR24","unstructured":"Kashyap, S., Min, C., Kim, T.: Scalable numa-aware blocking synchronization primitives. In: 2017 USENIX Annual Technical Conference (USENIX ATC 2017). USENIX Association (2017). https:\/\/www.usenix.org\/conference\/atc17\/technical-sessions\/presentation\/kashyap"},{"key":"13_CR25","unstructured":"Lim, B.H., Agarwal, A.: Reactive synchronization algorithms for multiprocessors. In: Proceedings of the Sixth International Conference on Architectural Support for Programming Languages and Operating Systems. ASPLOS VI (1994). http:\/\/doi.acm.org\/10.1145\/195473.195490"},{"key":"13_CR26","unstructured":"Long, W.: qspinlock: Introducing a 4-byte queue spinlock implementation. https:\/\/lwn.net\/Articles\/561775, July 31, 2013 (2013). Accessed 19 Sept. 2018"},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Luchangco, V., Nussbaum, D., Shavit, N.: Hierarchical clh queue lock. In: Euro-Par 2006 Parallel Processing. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11823285_84","DOI":"10.1007\/11823285_84"},{"key":"13_CR28","unstructured":"Auslander, M., Edelsohn, D., Wisniewski, O.K.B.R.: Enhancement to the mcs lock for increased functionality and improved programmability - u.s. patent application number 20030200457 (2003). https:\/\/patents.google.com\/patent\/US20030200457"},{"key":"13_CR29","unstructured":"Magnusson, P., Landin, A., Hagersten, E.: Queue locks on cache coherent multiprocessors. In: Proceedings of 8th International Parallel Processing Symposium (1994)"},{"key":"13_CR30","unstructured":"Mellor-Crummey, J.M., Scott, M.L.: Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans. Comput. Syst. (1991). http:\/\/doi.acm.org\/10.1145\/103727.103729"},{"key":"13_CR31","unstructured":"Radovi\u0107, Z., Hagersten, E.: Hierarchical Backoff Locks for Nonuniform Communication Architectures. In: International Symposium on High Performance Computer Architecture - HPCA. IEEE Computer Society (2003). http:\/\/dl.acm.org\/citation.cfm?id=822080.822810"},{"key":"13_CR32","doi-asserted-by":"crossref","unstructured":"Schweizer, H., Besta, M., Hoefler, T.: Evaluating the cost of atomic operations on modern architectures. In: 2015 International Conference on Parallel Architecture and Compilation (PACT) (2015)","DOI":"10.1109\/PACT.2015.24"},{"key":"13_CR33","doi-asserted-by":"crossref","unstructured":"Scott, M.L.: Shared-Memory Synchronization. Morgan & Claypool Publishers (2013)","DOI":"10.2200\/S00499ED1V01Y201304CAC023"},{"key":"13_CR34","unstructured":"Theil, H.: Economics and Information Theory. North-Holland (1967)"},{"key":"13_CR35","doi-asserted-by":"crossref","unstructured":"Verner, U., Mendelson, A., Schuster, A.: Extending amdahl\u2019s law for multicores with turbo boost. IEEE Computer Architecture Letters (2017). https:\/\/doi.org\/10.1109\/LCA.2015.2512982","DOI":"10.1109\/LCA.2015.2512982"},{"key":"13_CR36","unstructured":"Wikipedia Contributors: Coefficient of variation (2020). https:\/\/en.wikipedia.org\/wiki\/Coefficient_of_variation"},{"key":"13_CR37","unstructured":"Wikipedia Contributors: Matthew effect (2020). https:\/\/en.wikipedia.org\/wiki\/Matthew_effect"},{"key":"13_CR38","unstructured":"Wikipedia Contributors: Theil index (2020). https:\/\/en.wikipedia.org\/wiki\/Theil_index"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67087-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T01:51:54Z","timestamp":1610589114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-67087-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030670863","9783030670870"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67087-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"14 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NETYS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Networked Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marrakech","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/netys.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.75","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually. Three invited papers are also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}