English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Safe memory reclamation (SMR) schemes are an essential tool for lock-freedata structures and concurrent programming. However, manual SMR schemes arenotoriously difficult to apply correctly, and automatic schemes, such asreference counting, have been argued for over a decade to be too slow forpractical purposes. A recent wave of work has disproved this long-held notionand shown that reference counting can be as scalable as hazard pointers, one ofthe most common manual techniques. Despite these tremendous improvements, thereremains a gap of up to 2x or more in performance between these schemes andfaster manual techniques such as epoch-based reclamation (EBR).  In this work, we first advance these ideas and show that in many cases,automatic reference counting can in fact be as fast as the fastest manual SMRtechniques. We generalize our previous Concurrent Deferred Reference Counting(CDRC) algorithm to obtain a method for converting any standard manual SMRtechnique into an automatic reference counting technique with a similarperformance profile. Our second contribution is extending this framework tosupport weak pointers, which are reference-counted pointers that automaticallybreak pointer cycles by not contributing to the reference count, thusaddressing a common weakness in reference-counted garbage collection.  Our experiments with a C++-library implementation show that our automatictechniques perform in line with their manual counterparts, and that our weakpointer implementation outperforms the best known atomic weak pointer libraryby up to an order of magnitude on high thread counts. All together, we showthat the ease of use of automatic memory management can be achieved withoutsignificant cost to practical performance or general applicability.

Turning Manual Concurrent Memory Reclamation into Automatic Reference Counting