{"doi":"10.1145/2688500.2688523","title":"The SprayList: A scalable relaxed priority queue","publisher":"ACM","publication_status":"published","day":"24","author":[{"first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kopinsky","full_name":"Kopinsky, Justin","first_name":"Justin"},{"last_name":"Li","first_name":"Jerry","full_name":"Li, Jerry"},{"last_name":"Shavit","first_name":"Nir","full_name":"Shavit, Nir"}],"article_processing_charge":"No","date_updated":"2023-02-23T13:16:43Z","conference":{"name":"PPoPP: Principles and Practice of Parallel Pogramming"},"abstract":[{"text":"High-performance concurrent priority queues are essential for applications such as task scheduling and discrete event simulation. Unfortunately, even the best performing implementations do not scale past a number of threads in the single digits. This is because of the sequential bottleneck in accessing the elements at the head of the queue in order to perform a DeleteMin operation. In this paper, we present the SprayList, a scalable priority queue with relaxed ordering semantics. Starting from a non-blocking SkipList, the main innovation behind our design is that the DeleteMin operations avoid a sequential bottleneck by &quot;spraying&quot; themselves onto the head of the SkipList list in a coordinated fashion. The spraying is implemented using a carefully designed random walk, so that DeleteMin returns an element among the first O(plog3p) in the list, with high probability, where p is the number of threads. We prove that the running time of a DeleteMin operation is O(log3p), with high probability, independent of the size of the list. Our experiments show that the relaxed semantics allow the data structure to scale for high thread counts, comparable to a classic unordered SkipList. Furthermore, we observe that, for reasonably parallel workloads, the scalability benefits of relaxation considerably outweigh the additional work due to out-of-order execution.","lang":"eng"}],"_id":"776","extern":"1","date_published":"2015-01-24T00:00:00Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:48:26Z","acknowledgement":"Support is gratefully acknowledged from the National Science Foundation under grants CCF-1217921, CCF-1301926, and IIS-1447786, the Department of Energy under grant ER26116/DE-SC0008923, and the Oracle\r\nand Intel corporations.","volume":"2015-January","year":"2015","page":"11 - 20","oa_version":"None","citation":{"chicago":"Alistarh, Dan-Adrian, Justin Kopinsky, Jerry Li, and Nir Shavit. “The SprayList: A Scalable Relaxed Priority Queue,” 2015–January:11–20. ACM, 2015. <a href=\"https://doi.org/10.1145/2688500.2688523\">https://doi.org/10.1145/2688500.2688523</a>.","short":"D.-A. Alistarh, J. Kopinsky, J. Li, N. Shavit, in:, ACM, 2015, pp. 11–20.","apa":"Alistarh, D.-A., Kopinsky, J., Li, J., &#38; Shavit, N. (2015). The SprayList: A scalable relaxed priority queue (Vol. 2015–January, pp. 11–20). Presented at the PPoPP: Principles and Practice of Parallel Pogramming, ACM. <a href=\"https://doi.org/10.1145/2688500.2688523\">https://doi.org/10.1145/2688500.2688523</a>","ama":"Alistarh D-A, Kopinsky J, Li J, Shavit N. The SprayList: A scalable relaxed priority queue. In: Vol 2015-January. ACM; 2015:11-20. doi:<a href=\"https://doi.org/10.1145/2688500.2688523\">10.1145/2688500.2688523</a>","ista":"Alistarh D-A, Kopinsky J, Li J, Shavit N. 2015. The SprayList: A scalable relaxed priority queue. PPoPP: Principles and Practice of Parallel Pogramming vol. 2015–January, 11–20.","ieee":"D.-A. Alistarh, J. Kopinsky, J. Li, and N. Shavit, “The SprayList: A scalable relaxed priority queue,” presented at the PPoPP: Principles and Practice of Parallel Pogramming, 2015, vol. 2015–January, pp. 11–20.","mla":"Alistarh, Dan-Adrian, et al. <i>The SprayList: A Scalable Relaxed Priority Queue</i>. Vol. 2015–January, ACM, 2015, pp. 11–20, doi:<a href=\"https://doi.org/10.1145/2688500.2688523\">10.1145/2688500.2688523</a>."},"status":"public","publist_id":"6878","type":"conference","month":"01"}