{"date_updated":"2022-03-18T12:56:29Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"02","title":"Lease/Release: Architectural support for scaling contended data structures","publisher":"ACM","article_processing_charge":"No","doi":"10.1145/2851141.2851155","status":"public","publication_status":"published","day":"27","conference":{"name":"PPoPP: Principles and Practice of Parallel Pogramming"},"scopus_import":"1","date_created":"2018-12-11T11:48:29Z","publist_id":"6871","citation":{"apa":"Haider, S., Hasenplaugh, W., &#38; Alistarh, D.-A. (2016). Lease/Release: Architectural support for scaling contended data structures (Vol. 12-16-March-2016). Presented at the PPoPP: Principles and Practice of Parallel Pogramming, ACM. <a href=\"https://doi.org/10.1145/2851141.2851155\">https://doi.org/10.1145/2851141.2851155</a>","chicago":"Haider, Syed, William Hasenplaugh, and Dan-Adrian Alistarh. “Lease/Release: Architectural Support for Scaling Contended Data Structures,” Vol. 12-16-March-2016. ACM, 2016. <a href=\"https://doi.org/10.1145/2851141.2851155\">https://doi.org/10.1145/2851141.2851155</a>.","ama":"Haider S, Hasenplaugh W, Alistarh D-A. Lease/Release: Architectural support for scaling contended data structures. In: Vol 12-16-March-2016. ACM; 2016. doi:<a href=\"https://doi.org/10.1145/2851141.2851155\">10.1145/2851141.2851155</a>","ieee":"S. Haider, W. Hasenplaugh, and D.-A. Alistarh, “Lease/Release: Architectural support for scaling contended data structures,” presented at the PPoPP: Principles and Practice of Parallel Pogramming, 2016, vol. 12-16-March-2016.","ista":"Haider S, Hasenplaugh W, Alistarh D-A. 2016. Lease/Release: Architectural support for scaling contended data structures. PPoPP: Principles and Practice of Parallel Pogramming vol. 12-16-March-2016.","mla":"Haider, Syed, et al. <i>Lease/Release: Architectural Support for Scaling Contended Data Structures</i>. Vol. 12-16-March-2016, ACM, 2016, doi:<a href=\"https://doi.org/10.1145/2851141.2851155\">10.1145/2851141.2851155</a>.","short":"S. Haider, W. Hasenplaugh, D.-A. Alistarh, in:, ACM, 2016."},"abstract":[{"lang":"eng","text":"High memory contention is generally agreed to be a worst-case scenario for concurrent data structures. There has been a significant amount of research effort spent investigating designs which minimize contention, and several programming techniques have been proposed to mitigate its effects. However, there are currently few architectural mechanisms to allow scaling contended data structures at high thread counts. In this paper, we investigate hardware support for scalable contended data structures. We propose Lease/Release, a simple addition to standard directory-based MSI cache coherence protocols, allowing participants to lease memory, at the granularity of cache lines, by delaying coherence messages for a short, bounded period of time. Our analysis shows that Lease/Release can significantly reduce the overheads of contention for both non-blocking (lock-free) and lock-based data structure implementations, while ensuring that no deadlocks are introduced. We validate Lease/Release empirically on the Graphite multiprocessor simulator, on a range of data structures, including queue, stack, and priority queue implementations, as well as on transactional applications. Results show that Lease/Release consistently improves both throughput and energy usage, by up to 5x, both for lock-free and lock-based data structure designs."}],"author":[{"first_name":"Syed","full_name":"Haider, Syed","last_name":"Haider"},{"first_name":"William","full_name":"Hasenplaugh, William","last_name":"Hasenplaugh"},{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh"}],"type":"conference","language":[{"iso":"eng"}],"_id":"785","year":"2016","quality_controlled":"1","volume":"12-16-March-2016","extern":"1","date_published":"2016-02-27T00:00:00Z","oa_version":"None","acknowledgement":"We would like to thank Richard Black, Miguel Castro, Dave Dice, Aleksandar Dragojevic, Maurice Herlihy, Ant Rowstron, Nir Shavit, and Vasileios Trigonakis, as well as the anonymous reviewers, for helpful suggestions during the development of this paper."}