Unexpected scaling in path copying trees Aksenov, Vitaly Brown, Trevor A Fedorov, Alexander Kokorin, Ilya ddc:000 Although a wide variety of handcrafted concurrent data structures have been proposed, there is considerable interest in universal approaches (Universal Constructions or UCs) for building concurrent data structures. UCs (semi-)automatically convert a sequential data structure into a concurrent one. The simplest approach uses locks [3, 6] that protect a sequential data structure and allow only one process to access it at a time. However, the resulting data structure is blocking. Most work on UCs instead focuses on obtaining non-blocking progress guarantees such as obstruction-freedom, lock-freedom or wait-freedom. Many non-blocking UCs have appeared. Key examples include the seminal wait-free UC [2] by Herlihy, a NUMA-aware UC [10] by Yi et al., and an efficient UC for large objects [1] by Fatourou et al. Association for Computing Machinery 2023 info:eu-repo/semantics/other doc-type:other conference_poster http://purl.org/coar/resource_type/c_6670 https://research-explorer.ista.ac.at/record/12736 Aksenov V, Brown TA, Fedorov A, Kokorin I. <i>Unexpected Scaling in Path Copying Trees</i>. Association for Computing Machinery; 2023:438-440. doi:<a href="https://doi.org/10.1145/3572848.3577512">10.1145/3572848.3577512</a> eng info:eu-repo/semantics/altIdentifier/doi/10.1145/3572848.3577512 info:eu-repo/semantics/altIdentifier/isbn/9798400700156 info:eu-repo/semantics/openAccess